Sciweavers

462 search results - page 44 / 93
» Covering a Tree by a Forest
Sort
View
SODA
1994
ACM
138views Algorithms» more  SODA 1994»
14 years 11 months ago
Average Case Analysis of Dynamic Geometric Optimization
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
David Eppstein
DAGM
2011
Springer
13 years 9 months ago
Real Time Head Pose Estimation from Consumer Depth Cameras
We present a system for estimating location and orientation of a person’s head, from depth data acquired by a low quality device. Our approach is based on discriminative random r...
Gabriele Fanelli, Thibaut Weise, Juergen Gall, Luc...
FOCS
2009
IEEE
15 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
DAGM
2010
Springer
14 years 10 months ago
Learning of Optimal Illumination for Material Classification
We present a method to classify materials in illumination series data. An illumination series is acquired using a device which is capable to generate arbitrary lighting environment...
Markus Jehle, Christoph Sommer, Bernd Jähne
ACL
2008
14 years 11 months ago
A Tree Sequence Alignment-based Tree-to-Tree Translation Model
This paper presents a translation model that is based on tree sequence alignment, where a tree sequence refers to a single sequence of subtrees that covers a phrase. The model lev...
Min Zhang, Hongfei Jiang, AiTi Aw, Haizhou Li, Che...