Sciweavers

401 search results - page 25 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
ECCV
2008
Springer
16 years 4 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson
123
Voted
BIBE
2006
IEEE
135views Bioinformatics» more  BIBE 2006»
15 years 8 months ago
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
Bing Bing Zhou, Monther Tarawneh, Pinghao Wang, Da...
125
Voted
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 3 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
PCI
2005
Springer
15 years 8 months ago
Boundary Labelling of Optimal Total Leader Length
In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leaderlabel placement, such that the total leader len...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
CN
2008
117views more  CN 2008»
15 years 2 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...