Sciweavers

5904 search results - page 1144 / 1181
» Requirements for a Composition Language
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
DBPL
2003
Springer
92views Database» more  DBPL 2003»
15 years 3 months ago
A Query Algebra for Fragmented XML Stream Data
The increased usage of mobile devices coupled with an unprecedented demand for information has pushed the scalability problem of pull-based data service to the focus. A broadcast ...
Sujoe Bose, Leonidas Fegaras, David Levine, Vamsi ...
ICALP
2003
Springer
15 years 3 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
85
Voted
ICMI
2003
Springer
166views Biometrics» more  ICMI 2003»
15 years 3 months ago
Georgia tech gesture toolkit: supporting experiments in gesture recognition
Gesture recognition is becoming a more common interaction tool in the fields of ubiquitous and wearable computing. Designing a system to perform gesture recognition, however, can...
Tracy L. Westeyn, Helene Brashear, Amin Atrash, Th...
CLOUD
2010
ACM
15 years 3 months ago
Nephele/PACTs: a programming model and execution framework for web-scale analytical processing
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...
Dominic Battré, Stephan Ewen, Fabian Hueske...
« Prev « First page 1144 / 1181 Last » Next »