Sciweavers

10392 search results - page 1977 / 2079
» Introduction to Computer Science
Sort
View
MOBICOM
2004
ACM
15 years 6 months ago
Denial of service resilience in ad hoc networks
Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc ne...
Imad Aad, Jean-Pierre Hubaux, Edward W. Knightly

Book
410views
16 years 10 months ago
Action Arcade Adventure Set
"Have you ever played a side-scrolling action arcade game on your PC and wondered what it takes to program one? How do the programmers scroll their backgrounds so fast and mak...
Diana Gruber
102
Voted
SPAA
2009
ACM
16 years 1 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
146
Voted
ICALP
2009
Springer
16 years 25 days ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
106
Voted
COCOA
2009
Springer
15 years 5 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
« Prev « First page 1977 / 2079 Last » Next »