Sciweavers

725 search results - page 35 / 145
» A Generalization of Repetition Threshold
Sort
View
SI3D
1999
ACM
13 years 12 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
AAECC
2009
Springer
136views Algorithms» more  AAECC 2009»
14 years 2 months ago
There Are Not Non-obvious Cyclic Affine-invariant Codes
We show that an affine-invariant code C of length pm is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or it...
José Joaquín Bernal, Ángel de...
PVLDB
2008
107views more  PVLDB 2008»
13 years 7 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
WIAMIS
2009
IEEE
14 years 2 months ago
Full action instances for motion analysis
Motion analysis is an important component of surveillance, video annotation and many other applications. Current work focuses on the tracking of moving entities, the representatio...
Stergios Poularakis, Alexia Briassouli, Ioannis Ko...
AGP
1999
IEEE
13 years 12 months ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning