23098 search results - page 4368 / 4620 » Component Based Development |
189
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
189
click to vote
OSDI
2004
ACM
16 years 6 months ago
2004
ACM
Network worms are a clear and growing threat to the security of today's Internet-connected hosts and networks. The combination of the Internet's unrestricted connectivit...
215
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
178
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
264
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
Technology in the field of digital media generates huge amounts of nontextual information, audio, video, and images, along with more familiar textual information. The potential for...