Sciweavers

327 search results - page 43 / 66
» Algorithms for infinite huffman-codes
Sort
View
FSTTCS
2006
Springer
13 years 10 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 6 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
STTT
2010
120views more  STTT 2010»
13 years 1 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 7 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
LCN
2006
IEEE
14 years 23 days ago
Performance Limits and Analysis of Contention-based IEEE 802.11 MAC
— Recent advance in IEEE 802.11 based standard has pushed the wireless bandwidth up to 600Mbps while keeping the same wireless medium access control (MAC) schemes for full backwa...
Shao-Cheng Wang, Ahmed Helmy