Sciweavers

340 search results - page 48 / 68
» Efficient algorithms for bichromatic separability
Sort
View
CADE
2001
Springer
15 years 10 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
STOC
2007
ACM
169views Algorithms» more  STOC 2007»
15 years 10 months ago
Proportional response dynamics leads to market equilibrium
One of the main reasons of the recent success of peer to peer (P2P) file sharing systems such as BitTorrent is its built-in tit-for-tat mechanism. In this paper, we model the band...
Fang Wu, Li Zhang
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
15 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
ISCAS
1999
IEEE
128views Hardware» more  ISCAS 1999»
15 years 1 months ago
Dynamic scheduling of multiple video objects for MPEG-4 encoding with user interactions
MPEG-4 video consists of various video objects, rather than frames, allowing a true interactivity and manipulation of separate arbitrary shape object. Soware-based encoding of MPE...
Yong He, Ishfaq Ahmad, Ming L. Liou
DELTA
2004
IEEE
15 years 1 months ago
Scan Test of IP Cores in an ATE Environment
Manufacturing test of chips made of multiple IP cores requires different techniques if ATE is used. As scan chains are commonly used as access paths to the DUT, ATE architectures ...
Luca Schiano, Yong-Bin Kim, Fabrizio Lombardi