Sciweavers

1279 search results - page 204 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ACIVS
2006
Springer
14 years 2 months ago
Visibility of Point Clouds and Mapping of Unknown Environments
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
Yanina Landa, Richard Tsai, Li-Tien Cheng
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
ECCV
2004
Springer
14 years 10 months ago
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
This article proposes a solution of the Lambertian Shape From Shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solutions. The power ...
Emmanuel Prados, Olivier D. Faugeras
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
14 years 1 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim