Sciweavers

1447 search results - page 168 / 290
» Graphs and Path Equilibria
Sort
View
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
15 years 5 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
144
Voted
MICCAI
2008
Springer
16 years 5 months ago
Automatic Image Analysis of Histopathology Specimens Using Concave Vertex Graph
Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching ...
Lin Yang, Oncel Tuzel, Peter Meer, David J. For...
INFOCOM
2005
IEEE
15 years 10 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
148
Voted
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
15 years 9 months ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
144
Voted
COMPLEX
2009
Springer
15 years 8 months ago
Capturing Internet Traffic Dynamics through Graph Distances
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
Steve Uhlig, Bingjie Fu, Almerima Jamakovic