1632 search results - page 169 / 327 » Sublinear Time Algorithms for Metric Space Problems |
131
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
130
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
227
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
130
click to vote
MONET
2008
15 years 4 months ago
2008
Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or...
126
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...