3874 search results - page 282 / 775 » Approximation Algorithms for k-hurdle Problems |
145
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
176
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
159
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
186
Voted
TSMC
2010
14 years 11 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
165
click to vote
SAT
2010
Springer
15 years 2 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...