1040 search results - page 55 / 208 » Rounding algorithms for covering problems |
JMLR
2010
14 years 4 months ago
2010
The paper considers an interactive search paradigm in which at each round a user is presented with a set of k images and is required to select one that is closest to her target. P...
111
click to vote
TCBB
2011
14 years 4 months ago
2011
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...
122
click to vote
SIGECOM
2011
ACM
14 years 17 days ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
IJCGA
1998
14 years 9 months ago
1998
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...