292 search results - page 9 / 59 » Algorithms for Structural and Dynamical Polychronous Groups ... |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
BMVC
1997
13 years 9 months ago
1997
In this paper we present an algorithm for structure and motion (SM) recovery under affine projection from video sequences. The algorithm tracks the motion of a single structure, b...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
KDD
2009
ACM
14 years 6 days ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...