397 search results - page 77 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—Wireless communication is particularly vulnerable to signal jamming attacks. Spread spectrum mitigates such problem by spreading normal narrowband signals over a much wider band...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Multi-core processors have become an integral part of mainstream high performance computer systems. In parallel, exponentially increasing power density and packaging costs have ne...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
COMCOM
1998
13 years 7 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...