Sciweavers

725 search results - page 25 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
CAIP
1997
Springer
155views Image Analysis» more  CAIP 1997»
15 years 2 months ago
Discrete-Time Rigidity-Constrained Optical Flow
An algorithm for optical ow estimation is presented for the case of discrete-time motion of an uncalibrated camera through a rigid world. Unlike traditional optical ow approaches t...
Jeffrey Mendelsohn, Eero P. Simoncelli, Ruzena Baj...
BMCBI
2005
158views more  BMCBI 2005»
14 years 9 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
NIPS
2003
14 years 11 months ago
Can We Learn to Beat the Best Stock
A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our app...
Allan Borodin, Ran El-Yaniv, Vincent Gogan
DAC
1995
ACM
15 years 1 months ago
On the Bounded-Skew Clock and Steiner Routing Problems
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
Dennis J.-H. Huang, Andrew B. Kahng, Chung-Wen Alb...
CONSTRAINTS
2006
77views more  CONSTRAINTS 2006»
14 years 10 months ago
The Impact of Search Heuristics on Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan