Sciweavers

3946 search results - page 160 / 790
» The computational complexity of choice sets
Sort
View
FAST
2008
15 years 9 months ago
EIO: Error Handling is Occasionally Correct
The reliability of file systems depends in part on how well they propagate errors. We develop a static analysis technique, EDP, that analyzes how file systems and storage device d...
Haryadi S. Gunawi, Cindy Rubio-González, An...
PVLDB
2008
122views more  PVLDB 2008»
15 years 6 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
CVPR
2009
IEEE
17 years 1 months ago
Let the Kernel Figure it Out; Principled Learning of Pre-processing for Kernel Classifiers
Most modern computer vision systems for high-level tasks, such as image classification, object recognition and segmentation, are based on learning algorithms that are able to se...
Peter V. Gehler, Sebastian Nowozin
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 6 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
DCC
2008
IEEE
16 years 6 months ago
Compression of Hyperspectral Images with LVQ-SPECK
We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered, for examp...
Alessandro J. S. Dutra, William A. Pearlman, Eduar...