Sciweavers

4208 search results - page 23 / 842
» Better Selection of the Best
Sort
View
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
14 years 4 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
COMPGEOM
2010
ACM
14 years 4 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
COLING
2008
14 years 11 days ago
Improving Alignments for Better Confusion Networks for Combining Machine Translation Systems
The state-of-the-art system combination method for machine translation (MT) is the word-based combination using confusion networks. One of the crucial steps in confusion network d...
Necip Fazil Ayan, Jing Zheng, Wen Wang
SIROCCO
1997
14 years 8 days ago
Better Expanders and Superconcentrators by Kolmogorov Complexity
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
Uwe Schöning
ICPR
2002
IEEE
14 years 3 months ago
Better Features to Track by Estimating the Tracking Convergence Region
Reliably tracking key points and textured patches from frame to frame is the basic requirement for many bottomup computer vision algorithms. The problem of selecting the features ...
Zoran Zivkovic, Ferdinand van der Heijden