Sciweavers

132 search results - page 17 / 27
» On Optimally Partitioning a Text to Improve Its Compression
Sort
View
SIGIR
2006
ACM
14 years 2 months ago
Hybrid index maintenance for growing text collections
We present a new family of hybrid index maintenance strategies to be used in on-line index construction for monotonically growing text collections. These new strategies improve up...
Stefan Büttcher, Charles L. A. Clarke, Brad L...
COMBINATORICA
2010
13 years 3 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
CCE
2004
13 years 8 months ago
Module-oriented automatic differentiation in chemical process systems optimization
It is common that external procedures are incorporated into an equation-oriented model when modeling complex chemical process systems. The so-obtained models are called composite ...
Xiang Li, Zhijiang Shao, Jixin Qian
SASP
2009
IEEE
222views Hardware» more  SASP 2009»
14 years 3 months ago
Arithmetic optimization for custom instruction set synthesis
Abstract—One of the ways that custom instruction set extensions can improve over software execution is through the use of hardware structures that have been optimized at the arit...
Ajay K. Verma, Yi Zhu, Philip Brisk, Paolo Ienne
ICIP
2002
IEEE
14 years 10 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong