18306 search results - page 308 / 3662 » Algorithmics in Exponential Time |
206
click to vote
SIGIR
2004
ACM
16 years 5 days ago
2004
ACM
The exponential growth of data demands scalable infrastructures capable of indexing and searching rich content such as text, music, and images. A promising direction is to combine...
168
click to vote
COCO
2004
Springer
16 years 4 days ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
187
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
188
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
163
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...