3341 search results - page 363 / 669 » On Bounded Queries and Approximation |
184
click to vote
WEBDB
2005
Springer
16 years 5 days ago
2005
Springer
Querying document-centric XML collections with structure conditions improves retrieval precisions. The structures of such XML collections, however, are often too complex for users...
176
click to vote
IFIP
2004
Springer
16 years 2 days ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
200
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
152
click to vote
ICCAD
1996
IEEE
15 years 11 months ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
151
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...