Sciweavers

7006 search results - page 533 / 1402
» Approximation Algorithms
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Learning to classify with missing and corrupted features
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
Ofer Dekel, Ohad Shamir
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 8 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
ICASSP
2011
IEEE
14 years 10 months ago
Optimal wireless networks based on local channel state information
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Yichuan Hu, Alejandro Ribeiro
VLDB
2009
ACM
159views Database» more  VLDB 2009»
16 years 6 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
COLT
2003
Springer
15 years 11 months ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio