Sciweavers

1538 search results - page 149 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
129
Voted
CORR
2002
Springer
108views Education» more  CORR 2002»
15 years 3 months ago
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
Matthew Dickerson, David Eppstein, Michael T. Good...
162
Voted
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
15 years 1 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
ICASSP
2008
IEEE
15 years 10 months ago
Joint base-calling of two DNA sequences with factor graphs
—Automated estimation of DNA base-sequences is an important step in genomics and in many other emerging fields in biological and medical sciences. Current automated sequencers p...
Xiaomeng Shi, Desmond S. Lun, Jim Meldrim, Ralf K&...
SPIRE
2005
Springer
15 years 9 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
TSE
2008
113views more  TSE 2008»
15 years 3 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang