Sciweavers

227 search results - page 1 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
JGAA
2010
51views more  JGAA 2010»
13 years 3 months ago
New complexity results for time-constrained dynamical optimal path problems
Sebastian Kluge, Martin Brokate, Konrad Reif
EDBT
2010
ACM
392views Database» more  EDBT 2010»
13 years 11 months ago
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
François Deliège, Torben Bach Peders...
JSS
2007
120views more  JSS 2007»
13 years 4 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
COMCOM
2004
85views more  COMCOM 2004»
13 years 4 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
ICIP
2005
IEEE
14 years 6 months ago
Processing of textured surfaces represented as surfel sets: representation, compression and geodesic paths
A method for representation and lossy compression of textured surfaces is presented. The input surfaces are represented by surfels (surface elements), i.e., by a set of colored, o...
Tal Darom, Mauro R. Ruggeri, Dietmar Saupe, Nahum ...