Sciweavers

540 search results - page 61 / 108
» A New Compression Method for Compressed Matching
Sort
View
WIAMIS
2009
IEEE
15 years 4 months ago
Global motion estimation using variable block sizes and its application to object segmentation
Global motion is estimated either in the pixel domain or in block based domain. Until now, all the approaches regarding the latter are based on fixed sized blocks while the recent...
Marina Georgia Arvanitidou, Alexander Glantz, Andr...
PCM
2004
Springer
119views Multimedia» more  PCM 2004»
15 years 3 months ago
Temporal Error Concealment with Block Boundary Smoothing
Abstract. When a block is lost due to a transmission error in compressed bitstream, conventional temporal error concealment schemes try to conceal the lost block by recovering its ...
Woong Il Choi, Byeungwoo Jeon
CCP
2011
92views more  CCP 2011»
13 years 9 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
ICPADS
2002
IEEE
15 years 2 months ago
Hardware-based IP Routing Lookup with Incremental Update
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...
Pi-Chung Wang, Chia-Tai Chan, Shuo-Cheng Hu, Yu-Ch...
WEA
2007
Springer
97views Algorithms» more  WEA 2007»
15 years 3 months ago
Experimental Evaluations of Algorithms for IP Table Minimization
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
Angelo Fanelli, Michele Flammini, Domenico Mango, ...