2503 search results - page 322 / 501 » A study of 3-arc graphs |
214
click to vote
ESA
2011
Springer
14 years 5 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
175
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
170
click to vote
PAISI
2009
Springer
16 years 13 days ago
2009
Springer
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
185
click to vote
SARA
2009
Springer
16 years 12 days ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
187
click to vote
CIVR
2007
Springer
16 years 1 days ago
2007
Springer
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...