Sciweavers

438 search results - page 38 / 88
» Shallow Dependency Labeling
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 9 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
EOR
2008
83views more  EOR 2008»
13 years 9 months ago
Rerouting tunnels for MPLS network resource optimization
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
Olivier Klopfenstein
ENTCS
2007
121views more  ENTCS 2007»
13 years 8 months ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
IRAL
2003
ACM
14 years 2 months ago
Korean named entity recognition using HMM and CoTraining model
Namedentityrecognition isimportantinsophisticatedinformation service system such as Question Answering and Text Mining since most of the answer type and text mining unit depend on...
Euisok Chung, Yi-Gyu Hwang, Myung-Gil Jang
IANDC
2006
121views more  IANDC 2006»
13 years 8 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton