4894 search results - page 514 / 979 » The Guarding Problem - Complexity and Approximation |
282
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
165
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
139
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...
144
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
140
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...