Sciweavers

2635 search results - page 10 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICCV
2009
IEEE
16 years 4 months ago
Recovering the Spatial Layout of Cluttered Rooms
In this paper, we consider the problem of recovering the spatial layout of indoor scenes from monocular images. The presence of clutter is a major problem for existing singleview...
Varsha Hedau, Derek Hoiem, David Forsyth
SIROCCO
2004
15 years 1 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
BMCBI
2007
200views more  BMCBI 2007»
14 years 11 months ago
BNDB - The Biochemical Network Database
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored ...
Jan Küntzer, Christina Backes, Torsten Blum, ...
91
Voted
COR
2007
97views more  COR 2007»
14 years 11 months ago
Two-stage general block patterns for the two-dimensional cutting problem
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
Yaodong Cui, Xianquan Zhang
DAC
1989
ACM
15 years 3 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong