3223 search results - page 56 / 645 » The Scaling of Search Cost |
ICTAI
1999
IEEE
14 years 12 days ago
1999
IEEE
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
ESORICS
2009
Springer
14 years 2 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...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
MICRO
2005
IEEE
14 years 1 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
14 years 1 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...