Sciweavers

8413 search results - page 1091 / 1683
» Ordering Problem Subgoals
Sort
View
VLDB
2004
ACM
186views Database» more  VLDB 2004»
16 years 17 days ago
Indexing Large Human-Motion Databases
Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actor...
Eamonn J. Keogh, Themis Palpanas, Victor B. Zordan...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
16 years 14 days 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
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
16 years 14 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
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 ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
INFOCOM
2002
IEEE
16 years 5 days ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 12 months ago
The nullspace method - a unifying paradigm to fault detection
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
András Varga
« Prev « First page 1091 / 1683 Last » Next »