Sciweavers

727 search results - page 58 / 146
» One line and n points
Sort
View
107
Voted
COMCOM
1998
98views more  COMCOM 1998»
15 years 6 days ago
IP multicast group management for point-to-point local distribution
—We examine the applicability of existing IP multicast mechanisms for Point-to-Point links such as wired and wireless telephone lines. We identify problems such as overhead due t...
George Xylomenos, George C. Polyzos
CCCG
1993
15 years 1 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
127
Voted
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 6 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
COLT
2006
Springer
15 years 2 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth
ECCV
2004
Springer
16 years 2 months ago
Iso-disparity Surfaces for General Stereo Configurations
Abstract. This paper discusses the iso-disparity surfaces for general stereo configurations. These are the surfaces that are observed at the same resolution along the epipolar line...
Marc Pollefeys, Sudipta N. Sinha