Sciweavers

1542 search results - page 204 / 309
» The metamathematics of random graphs
Sort
View
ECCV
2006
Springer
16 years 3 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
15 years 6 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
15 years 6 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 1 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
PE
2008
Springer
108views Optimization» more  PE 2008»
15 years 1 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg