97 search results - page 9 / 20 » Tight lower bounds for halfspace range searching |
TVLSI
1998
14 years 11 months ago
1998
— Excessive instantaneous power consumption may reduce the reliability and performance of VLSI chips. Hence, to synthesize circuits with high reliability, it is imperative to efï...
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
VTC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Placing relays around the base station (BS) to assist wireless communication is an effective way of extending coverage in cellular systems. This paper provides a quantitative a...