1461 search results - page 24 / 293 » The Cost of Cache-Oblivious Searching |
ILP
2004
Springer
15 years 5 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
ESORICS
2009
Springer
15 years 6 months ago
2009
Springer
For nearest neighbor search, a user queries a server for nearby points of interest (POIs) with his/her location information. Our aim is to protect the user’s sensitive informatio...
119
click to vote
MICRO
2005
IEEE
15 years 5 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
100
click to vote
ISCC
2006
IEEE
15 years 5 months ago
2006
IEEE
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...