Sciweavers

3889 search results - page 185 / 778
» A Framework for Optimizing Paper Matching
Sort
View
133
Voted
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 7 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
146
Voted
GD
2000
Springer
15 years 7 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood
149
Voted
CVPR
2008
IEEE
16 years 5 months ago
FusionFlow: Discrete-continuous optimization for optical flow estimation
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
Victor S. Lempitsky, Stefan Roth, Carsten Rother
137
Voted
JVA
2006
IEEE
15 years 9 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
89
Voted
ICIP
2009
IEEE
16 years 4 months ago
An Efficient Bayesian Framework For On-line Action Recognition
On-line action recognition from a continuous stream of actions is still an open problem with fewer solutions proposed compared to time-segmented action recognition. The most chall...