Sciweavers

279 search results - page 22 / 56
» Reduction approaches for robust shortest path problems
Sort
View
MOBIHOC
2005
ACM
15 years 10 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ICCV
2009
IEEE
16 years 4 months ago
Robust Fitting of Multiple Structures: The Statistical Learning Approach
We propose an unconventional but highly effective approach to robust fitting of multiple structures by using statistical learning concepts. We design a novel Mercer kernel for t...
Tat-Jun Chin, Hanzi Wang, David Suter
ICCD
2004
IEEE
113views Hardware» more  ICCD 2004»
15 years 8 months ago
End-to-End Testability Analysis and DfT Insertion for Mixed-Signal Paths
Increasing system complexity and test cost demands new system-level solutions for mixed-signal systems. In this paper, we present a testability analysis and DfT insertion methodol...
Sule Ozev, Alex Orailoglu
EOR
2006
70views more  EOR 2006»
14 years 11 months ago
Heuristics for matrix bandwidth reduction
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
Andrew Lim, Brian Rodrigues, Fei Xiao
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 5 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs