Works Published in 2003

search works

Displaying works 101 - 120 of 122 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

2003 article

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases

JOURNAL OF SYMBOLIC COMPUTATION, Vol. 36, pp. 401–424.

By: M. Giesbrecht*, E. Kaltofen n & W. Lee*

author keywords: sparse shifts; early termination; sparse polynomial; sparse interpolation; Chebyshev basis; Pochhammer basis
TL;DR: These algorithms are based on the early termination version of sparse interpolation algorithms: for a symbolic set of interpolation points, a sparsest shift must be a root of the first possible zero discrepancy that can be used as the earlytermination test. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 chapter

Exercising qualitative control in autonomous adaptive survivable systems

In P. R. R. Laddaga & H. Shrobe (Eds.), Self-adaptive software: Applications: Second International Workshop, IWSAS 2001, Balatonfu?red, Hungary, May 17-19, 2001: Revised papers (Vol. 2614, pp. 158–170). Berlin; New York: Springer.

By: J. Doyle & M. McGeachie

Ed(s): P. R. Laddaga & H. Shrobe

Source: NC State University Libraries
Added: August 6, 2018

2003 article

Communication characteristics of large-scale scientific applications for contemporary cluster architectures

Vetter, J. S., & Mueller, F. (2003, September). JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, Vol. 63, pp. 853–865.

TL;DR: This paper examines the explicit communication characteristics of several sophisticated scientific applications, which, by themselves, constitute a representative suite of publicly available benchmarks for large cluster architectures by focusing on the Message Passing Interface (MPI) and by using hardware counters on the microprocessor. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

An adaptive social network for information access: Theoretical and experimental results

Applied Artificial Intelligence, 17(1), 21–38.

By: B. Yu, M. Venkatraman & M. Singh

Contributors: M. Singh, M. Venkatraman, B. Yu & M. Singh

Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018

2003 journal article

A nonlinear diffusion-based three-band filter bank

IEEE SIGNAL PROCESSING LETTERS, 10(12), 360–363.

By: A. Benazza-Benyahia*, J. Pesquet* & H. Krim n

author keywords: diffusion; edge preservation; filter banks; multiresolution analysis; nonlinearity; partial differential equation (PDE); Perona-Malik; scale-space; wavelets
TL;DR: This letter addresses the problem of designing appropriate operators associated to nonlinear filter banks using multiscale analysis using scale-space theory and proposes specific structures of nonlinear three-band decompositions ensuring a perfect reconstruction. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

On the existence of Hamiltonian paths in the cover graph of M(n)

DISCRETE MATHEMATICS, 262(1-3), 241–252.

author keywords: Hamiltonian path; gray code; cover graph; augmentation poset
TL;DR: It is shown that the cover graph of M(n) has a Hamiltonian path if and only if(n+12) is odd and n ≠ 5. (via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education (Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 chapter

Improving query performance using materialized XML views: A learning-based approach

In Conceptual modeling for novel application domains: ER 2003 workshops ECOMO, IWCMQ, AOIS, and XSDM, Chicago, IL, USA, October 13, 2003: proceedings / Manfred Jeusfeld; Oscar Pastor (eds.). New York: Springer-Verlag, 2003. (Lecture notes in computer science ; 2814). (Vol. 2814, pp. 297–310).

By: A. Shah n & R. Chirkova n

TL;DR: This paper shows that selective materialization of data as XML views reduces query-execution costs in relatively static databases and can significantly reduce processing costs for frequent and important queries on relational databases with XML interfaces. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

A generalized divergence measure for robust image registration

IEEE Transactions on Signal Processing, 51(5), 1211–1220.

TL;DR: This paper defines a new generalized divergence measure, namely, the Jensen-Renyi (1996, 1976) divergence, and proposes a new approach to the problem of image registration based on it, to measure the statistical dependence between consecutive ISAR image frames. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 article

Successful software projects need requirements planning

IEEE SOFTWARE, Vol. 20, pp. 44-+.

By: A. Anton n

TL;DR: Expressing a set of complete, consistent, and correct requirements is conceptually complex, but essential in the quest to develop high-quality, useful software. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Real-valued, low rank, circulant approximation

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 24(3), 645–659.

By: M. Chu* & R. Plemmons*

author keywords: real-valued circulant matrix; lower rank; nearest approximation; conjugate-even; fast Fourier transform; truncated singular value decomposition
TL;DR: This paper investigates the case of approximating a given target matrix by a real-valued circulant matrix of a specified, fixed, and low rank by proposing a fast Fourier transform (FFT)-based numerical procedure. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Well-abstracted transition systems: application to FIFO automata

INFORMATION AND COMPUTATION, 181(1), 1–31.

By: A. Finkel, S. Iyer* & G. Sutre

author keywords: infinite state systems; abstraction; symbolic representation; acceleration; protocols; FIFO automata; regular expressions; flatness
TL;DR: This work investigates SemiLinear Regular Expressions (SLREs) as symbolic representations for FIFO automata and shows that SLREs are easy to manipulate and sufficient to represent the effect of arbitrary iterations of a loop for FIFE automata with one channel. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Object representation and recognition in shape spaces

PATTERN RECOGNITION, 36(5), 1143–1154.

By: J. Zhang*, X. Zhang*, H. Krim n & G. Walter*

author keywords: shape space; object recognition; legendre polynomials; statistical shape analysis; invariants
TL;DR: A shape space based approach for invariant object representation and recognition that is invariant to similarity transformations and is relatively insensitive to noise and occlusion, potentially used for 3D object recognition. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Grinding temperature measurements in magnesia-partially-stabilized zirconia using infrared spectrometry

JOURNAL OF THE AMERICAN CERAMIC SOCIETY, 86(2), 333–341.

By: A. Curry n, A. Shih*, J. Kong n, R. Scattergood n & S. McSpadden*

Source: Web Of Science
Added: August 6, 2018

2003 article

Functional paleontology: The evolution of user-visible system services

Anton, A. I., & Potts, C. (2003, February). IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, Vol. 29, pp. 151–166.

author keywords: measurement; metrics; empirical methods; reverse engineering; requirements engineering; software evolution
TL;DR: This paper describes "functional paleontology," an approach to analyzing the evolution of user-visible features or services independent of architecture and design intent, and classify the benefits and burdens of interpersonal communication services into core and peripheral categories. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 article

User studies: Why, how, and when?

IEEE COMPUTER GRAPHICS AND APPLICATIONS, Vol. 23, pp. 20–25.

TL;DR: This article describes how the authors designed experiments to answer important questions from their own research and offers suggestions and lessons learned about experimental design. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Structured low rank approximation

LINEAR ALGEBRA AND ITS APPLICATIONS, 366, 157–172.

author keywords: structured matrix; low rank approximation; optimization techniques; Toeplitz matrix
TL;DR: Two procedures for constructing the nearest structured low rank matrix are proposed and are flexible enough that they can be applied to any lower rank, any linear structure, and any matrix norm in the measurement of nearness. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Fast minimization of structural risk by nearest neighbor rule

IEEE TRANSACTIONS ON NEURAL NETWORKS, 14(1), 127–137.

By: B. Karacali n & H. Krim n

author keywords: breast cancer detection; index set thinning algorithm; multivariate order statistics; nearest neighbor rule; support vector machine (SVM)
TL;DR: Simulation results on real data indicate that this method significantly reduces the computational cost of the conventional SVMs, and achieves a nearly comparable test error performance. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Eudoxus meets Cayley

AMERICAN MATHEMATICAL MONTHLY, 110(10), 912–927.

Source: Web Of Science
Added: August 6, 2018

2003 journal article

Computing call-blocking probabilities in leo satellite constellations

IEEE Transactions on Vehicular Technology, 52(3), 622–636.

By: A. Zaim n, H. Perros n & G. Rouskas n

Contributors: H. Perros n, G. Rouskas n & A. Zaim n

author keywords: call blocking; handoffs; low earth orbit (LEO) satellite constellations
TL;DR: An analytical model for computing call- blocking probabilities in a low Earth orbit (LEO) satellite network that carries voice calls and derives an upper and lower bound for the link-blocking probabilities that can be computed efficiently. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID, NC State University Libraries, Crossref
Added: August 6, 2018

2003 article

Access protocols for optical burst-switched ring networks

Xu, L. S., Perros, H. G., & Rouskas, G. N. (2003, January). INFORMATION SCIENCES, Vol. 149, pp. 75–81.

By: L. Xu n, H. Perros n & G. Rouskas n

Contributors: H. Perros n, G. Rouskas n & L. Xu n

author keywords: optical burst switching; ring; MAN; access protocols
TL;DR: This paper considers a WDM metro ring architecture with optical burst switching with several access protocols proposed and their performance is analyzed by simulation. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.