Sciweavers

387 search results - page 46 / 78
» Many Random Walks Are Faster Than One
Sort
View
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
14 years 1 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
14 years 1 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
CVPR
2005
IEEE
14 years 11 months ago
The Modified pbM-Estimator Method and a Runtime Analysis Technique for the RANSAC Family
Robust regression techniques are used today in many computer vision algorithms. Chen and Meer recently presented a new robust regression technique named the projection based M-est...
Stas Rozenfeld, Ilan Shimshoni
DATE
2008
IEEE
131views Hardware» more  DATE 2008»
14 years 3 months ago
Parametric Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...
ICSM
2007
IEEE
14 years 3 months ago
JTourBus: Simplifying Program Understanding by Documentation that Provides Tours Through the Source Code
Many small and medium-sized systems have little or no design documentation, which makes program understanding during maintenance enormously more difficult when performed by outsi...
Christopher Oezbek, Lutz Prechelt