Sciweavers

4009 search results - page 159 / 802
» Clustering on Complex Graphs
Sort
View
DIS
2007
Springer
15 years 8 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
14 years 7 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
163
Voted
AVI
2006
15 years 5 months ago
Line graph explorer: scalable display of line graphs using Focus+Context
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
Robert Kincaid, Heidi Lam
139
Voted
COLT
2007
Springer
15 years 10 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
134
Voted
MICRO
1998
IEEE
91views Hardware» more  MICRO 1998»
15 years 8 months ago
Effective Cluster Assignment for Modulo Scheduling
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
Erik Nystrom, Alexandre E. Eichenberger