Sciweavers

10493 search results - page 248 / 2099
» Dynamic Word Problems
Sort
View
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
14 years 2 months ago
On time-scale designs for networks
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
Sandip Roy, Yan Wan, Ali Saberi
TON
2002
91views more  TON 2002»
13 years 8 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
TAMC
2007
Springer
14 years 2 months ago
Synchronization of Some DFA
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
A. N. Trahtman
ACL
2008
13 years 9 months ago
Summarizing Emails with Conversational Cohesion and Subjectivity
In this paper, we study the problem of summarizing email conversations. We first build a sentence quotation graph that captures the conversation structure among emails. We adopt t...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
ESWA
2007
117views more  ESWA 2007»
13 years 8 months ago
An HMM for detecting spam mail
Hidden Markov Models, or HMMs for short, have been recently used in Bioinformatics for the classification of DNA or protein chains, giving rise to what is known as Profile Hidde...
José Gordillo, Eduardo Conde