4903 search results - page 585 / 981 » The Set Covering Machine |
188
Voted
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
255
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
203
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
208
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...