Sciweavers

2877 search results - page 78 / 576
» The Complexity of Planarity Testing
Sort
View
MANSCI
2010
113views more  MANSCI 2010»
15 years 2 months ago
Prediction Markets: Alternative Mechanisms for Complex Environments with Few Traders
Double auction prediction markets have proven successful in large-scale applications such as elections and sporting events. Consequently, several large corporations have adopted t...
Paul J. Healy, Sera Linardi, J. Richard Lowery, Jo...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
IPPS
1998
IEEE
15 years 8 months ago
Testing of Synchronization Conditions for Distributed Real-Time Applications
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specifica...
Ajay D. Kshemkalyani
CVPR
2010
IEEE
15 years 11 months ago
Geo-location estimation from two shadow trajectories
The position of a world point’s solar shadow depends on its geographical location, the geometrical relationship between the orientation of the sunshine and the ground plane wher...
Lin Wu, Xiaochun Cao
IROS
2008
IEEE
113views Robotics» more  IROS 2008»
15 years 10 months ago
Navigating dynamic environments using trajectory deformation
Abstract— Path deformation is a technique that was introduced to generate robot motion wherein a path, that has been computed beforehand, is continuously deformed on-line in resp...
Vivien Delsart, Thierry Fraichard