2100 search results - page 47 / 420 » Fundamentals of the problem |
151
click to vote
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
149
click to vote
SIROCCO
2004
15 years 7 months ago
2004
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...
153
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
149
Voted
ECCV
2000
Springer
15 years 10 months ago
2000
Springer
We describe in this paper closed-form solutions to the following problems in multi-view geometry of n'th order curves: i recovery of the fundamental matrix from 4 or more c...
136
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...