Sciweavers

1066 search results - page 111 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
CG
2008
Springer
14 years 10 months ago
Tight and efficient surface bounds in meshless animation
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
Denis Steinemann, Miguel A. Otaduy, Markus H. Gros...
ACCV
2010
Springer
14 years 4 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang
PPOPP
2010
ACM
15 years 7 months ago
NOrec: streamlining STM by abolishing ownership records
Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusua...
Luke Dalessandro, Michael F. Spear, Michael L. Sco...
WINE
2005
Springer
161views Economy» more  WINE 2005»
15 years 3 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
ICIW
2009
IEEE
15 years 4 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...