1461 search results - page 26 / 293 » The Cost of Cache-Oblivious Searching |
121
click to vote
CIAC
1994
Springer
15 years 3 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
102
click to vote
ISSS
1996
IEEE
15 years 3 months ago
1996
IEEE
The paper presents two heuristics for hardware/software partitioning of system level specifications. The main objective is to achieve performance optimization with a limited hardw...
125
click to vote
MOBISYS
2010
ACM
15 years 2 months ago
2010
ACM
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
100
click to vote
WIOPT
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...