1133 search results - page 117 / 227 » Basics of Graph Cuts |
EDCC
2005
Springer
15 years 3 months ago
2005
Springer
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
AIRWEB
2007
Springer
15 years 4 months ago
2007
Springer
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
SIAMJO
2008
14 years 9 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...