Sciweavers

7150 search results - page 195 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
IPL
2008
105views more  IPL 2008»
15 years 6 months ago
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
Mario A. Lopez, Shlomo Reisner
IDA
2007
Springer
15 years 6 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
ICCV
2011
IEEE
14 years 6 months ago
Who Blocks Who: Simultaneous Clothing Segmentation for Grouping Images
Clothing is one of the most informative cues of human appearance. In this paper, we propose a novel multi-person clothing segmentation algorithm for highly occluded images. The ke...
Wang Nan, Haizhou Ai
ICML
2006
IEEE
16 years 7 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
Kimmo Fredriksson, Szymon Grabowski