894 search results - page 159 / 179 » Universal Relations and |
AWIC
2003
Springer
14 years 1 months ago
2003
Springer
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
ICMI
2003
Springer
14 years 1 months ago
2003
Springer
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...
STOC
2010
ACM
14 years 24 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
SIGECOM
2010
ACM
14 years 23 days ago
2010
ACM
We designed and built the Gates Hillman Prediction Market (GHPM) to predict the opening day of the Gates and Hillman Centers, the new computer science buildings at Carnegie Mellon...