Sciweavers

1066 search results - page 43 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
EGH
2003
Springer
15 years 2 months ago
CULLIDE: interactive collision detection between complex models in large environments using graphics hardware
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
Naga K. Govindaraju, Stephane Redon, Ming C. Lin, ...
VSTTE
2012
Springer
13 years 5 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
15 years 9 months ago
Computing Clusters of Correlation Connected Objects
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
Christian Böhm, Karin Kailing, Peer Krög...
FOCS
2008
IEEE
15 years 4 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...
CORR
2008
Springer
130views Education» more  CORR 2008»
14 years 9 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux