Sciweavers

10493 search results - page 87 / 2099
» Dynamic Word Problems
Sort
View
TALG
2008
124views more  TALG 2008»
13 years 7 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
ICASSP
2008
IEEE
14 years 2 months ago
Polyphase speech recognition
We propose a model for speech recognition that consists of multiple semi-synchronized recognizers operating on a polyphase decomposition of standard speech features. Specifically...
Hui Lin, Jeff Bilmes
EOR
2008
136views more  EOR 2008»
13 years 8 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
WWW
2007
ACM
14 years 8 months ago
Summarizing email conversations with clue words
Accessing an ever increasing number of emails, possibly on small mobile devices, has become a major problem for many users. Email summarization is a promising way to solve this pr...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
CSL
2010
Springer
13 years 9 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis