777 search results - page 45 / 156 » A fast algorithm for the computation of an upper bound on th... |
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, we describe an algorithm called Fast Marching Watersheds that segments a triangle mesh into visual parts. This computer vision algorithm leverages a human vision th...
MP
2010
13 years 6 months ago
2010
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...