2313 search results - page 343 / 463 » On Heuristic Time Hierarchies |
160
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
167
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
243
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Query generators producing sequences of SQL statements are embedded in many applications. As the execution time of such sequences is often far from optimal, their optimization is ...
190
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
182
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...