Sciweavers

545 search results - page 35 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
CISS
2010
IEEE
13 years 4 days ago
Transmission coordination for ad hoc networks
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
Ananth V. Kini, Steven Weber, Fadi A. Aloul, Nagar...
ICML
2008
IEEE
14 years 9 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
ICML
2008
IEEE
14 years 9 months ago
Training structural SVMs when exact inference is intractable
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
Thomas Finley, Thorsten Joachims
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
14 years 2 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
SIGCOMM
2006
ACM
14 years 2 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...