Sciweavers

446 search results - page 68 / 90
» Extremal Stable Graphs
Sort
View
SIGCOMM
2012
ACM
11 years 11 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
TVCG
2012
203views Hardware» more  TVCG 2012»
11 years 11 months ago
Morse Set Classification and Hierarchical Refinement Using Conley Index
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
Guoning Chen, Qingqing Deng, Andrzej Szymczak, Rob...
ECCV
2008
Springer
14 years 10 months ago
Learning Two-View Stereo Matching
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
14 years 9 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
SASO
2008
IEEE
14 years 2 months ago
Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...
Katharina Anna Zweig, Karin Zimmermann