6740 search results - page 1226 / 1348 » An s -Hamiltonian Line Graph Problem |
229
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
130
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
145
Voted
PODS
2005
ACM
16 years 4 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
121
click to vote
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
157
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...