Sciweavers

728 search results - page 2 / 146
» Compressing combinatorial objects
Sort
View
ICPR
2010
IEEE
13 years 8 months ago
Efficient Encoding of N-D Combinatorial Pyramids
Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are def...
Sébastien Fourey, Luc Brun
GBRPR
2009
Springer
13 years 3 months ago
A First Step toward Combinatorial Pyramids in n-D Spaces
Abstract. Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids...
Sébastien Fourey, Luc Brun
ICIAR
2009
Springer
14 years 22 days ago
Video Compression and Retrieval of Moving Object Location Applied to Surveillance
Abstract. A major problem in surveillance systems is the storage requirements for video archival; videos are recorded continuously for long periods of time, resulting in large amou...
William Robson Schwartz, Hélio Pedrini, Lar...
TIT
2008
107views more  TIT 2008»
13 years 6 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
13 years 8 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz