Sciweavers

2163 search results - page 173 / 433
» cases 2004
Sort
View
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
VLDB
2004
ACM
139views Database» more  VLDB 2004»
16 years 6 months ago
Amit - the situation manager
: This paper presents the "situation manager", a tool that includes both a language and an efficient run-time execution mechanism, aimed at reducing the complexity of act...
Asaf Adi, Opher Etzion
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 6 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
PERCOM
2004
ACM
16 years 6 months ago
PCOM - A Component System for Pervasive Computing
Applications in the Pervasive Computing domain are challenged by the dynamism in which their execution environment changes, e.g. due to user mobility. As a result, applications ha...
Christian Becker, Marcus Handte, Gregor Schiele, K...
PERCOM
2004
ACM
16 years 6 months ago
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
Marco Mamei, Franco Zambonelli