13376 search results - page 2431 / 2676 » Problem Solving with |
149
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
147
click to vote
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
117
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
Although variational methods are among the most accurate techniques for estimating the optical flow, they have not yet entered the field of real-time vision. Main reason is the gr...
130
Voted
WABI
2009
Springer
15 years 10 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
126
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...