1461 search results - page 48 / 293 » The Cost of Cache-Oblivious Searching |
120
click to vote
SAT
2010
Springer
14 years 10 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
MSWIM
2003
ACM
15 years 5 months ago
2003
ACM
In this paper, we address a fundamental problem concerning the best flooding strategy to minimize cost and latency for target discovery in wireless networks. Should we flood the ...
101
click to vote
ICML
2005
IEEE
16 years 19 days ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
A joint rate-distortion-complexity H.264 motion search framework is proposed to balance the encoder’s coding efficiency and complexity in an embedded system environment. Under ...
ICDCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...