752 search results - page 90 / 151 » Faster approximation algorithms for the minimum latency prob... |
139
click to vote
IIS
2003
15 years 4 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
130
click to vote
DEDS
2010
15 years 3 months ago
2010
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
138
click to vote
SENSYS
2003
ACM
15 years 8 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
144
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
141
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...