Sciweavers

154 search results - page 12 / 31
» Near Best Tree Approximation
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 2 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
ICALP
2009
Springer
14 years 7 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 9 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
TIP
2008
195views more  TIP 2008»
13 years 7 months ago
Image Coding Using Dual-Tree Discrete Wavelet Transform
In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. Three methods for sp...
Jingyu Yang, Yao Wang, Wenli Xu, Qionghai Dai