4009 search results - page 203 / 802 » Clustering on Complex Graphs |
141
click to vote
IPL
2010
15 years 2 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
169
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
166
click to vote
ICAIL
2005
ACM
15 years 9 months ago
2005
ACM
Computational resources for research in legal environments have historically implied remote access to large databases of legal documents such as case law, statutes, law reviews an...
130
click to vote
OODBS
2000
15 years 7 months ago
2000
Ever since the `early days' of database management systems, clustering has proven to be one of the most effective performance enhancement techniques for object oriented datab...
131
click to vote
DGCI
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...