Sciweavers

161 search results - page 12 / 33
» Learning Finite Automata Using Label Queries
Sort
View
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 5 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
IANDC
2006
121views more  IANDC 2006»
13 years 7 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
ITICSE
2004
ACM
14 years 25 days ago
Generation as method for explorative learning in computer science education
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
Andreas Kerren
WWW
2007
ACM
14 years 8 months ago
Identifying ambiguous queries in web search
It is widely believed that some queries submitted to search engines are by nature ambiguous (e.g., java, apple). However, few studies have investigated the questions of "how ...
Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, H...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...