Sciweavers

4539 search results - page 647 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
16 years 17 days ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
IMC
2007
ACM
15 years 8 months ago
Legal issues surrounding monitoring during network research
This work was motivated by a discussion that two of the coauthors (computer science professors) had with the other coauthor (a law professor and a former computer crime Trial Atto...
Douglas C. Sicker, Paul Ohm, Dirk Grunwald
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
CVPR
2011
IEEE
15 years 1 months ago
Supervised Local Subspace Learning for Continuous Head Pose Estimation
Head pose estimation from images has recently attracted much attention in computer vision due to its diverse applications in face recognition, driver monitoring and human computer...
Dong Huang, Markus Storer, Fernando DelaTorre, Hor...
EDBT
2006
ACM
143views Database» more  EDBT 2006»
16 years 6 months ago
XG: A Grid-Enabled Query Processing Engine
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Thom...