1133 search results - page 205 / 227 » Basics of Graph Cuts |
DM
2006
13 years 7 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Book
"This book is about the fundamentals of data structures and algorithms--the basic elements from which large and complex software artifacts are built. To develop a solid unders...
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...