3898 search results - page 418 / 780 » On the Bit Extraction Problem |
180
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
145
click to vote
SOSP
2005
ACM
16 years 1 months ago
2005
ACM
We present a method for automatically extracting from a running system an indexable signature that distills the essential characteristic from a system state and that can be subjec...
165
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
163
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
134
click to vote
COCO
2003
Springer
15 years 10 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...