88 search results - page 13 / 18 » Improved Bounds and Schemes for the Declustering Problem |
ISCC
2003
IEEE
14 years 8 days ago
2003
IEEE
We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector Ò ½...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
IV
2002
IEEE
13 years 12 months ago
2002
IEEE
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...