Sciweavers

7129 search results - page 823 / 1426
» Approximation Algorithms for Treewidth
Sort
View
154
Voted
TIT
2008
81views more  TIT 2008»
15 years 6 months ago
Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
Abstract--In this paper, the Lagrangian formulation of variablerate vector quantization is extended to quantization with simultaneous constraints on entropy and codebook size, incl...
Robert M. Gray, Tamás Linder, John T. Gill ...
137
Voted
TSMC
2008
136views more  TSMC 2008»
15 years 6 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
IDA
1998
Springer
15 years 6 months ago
Fast Dimensionality Reduction and Simple PCA
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
Matthew Partridge, Rafael A. Calvo
CN
1999
73views more  CN 1999»
15 years 6 months ago
Measuring Index Quality Using Random Walks on the Web
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
TIT
2002
62views more  TIT 2002»
15 years 6 months ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon