Sciweavers

381 search results - page 75 / 77
» Scaling question answering to the Web
Sort
View
SOFSEM
2007
Springer
14 years 1 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
ATAL
2006
Springer
13 years 11 months ago
Convergence analysis for collective vocabulary development
We study how decentralized agents can develop a shared vocabulary without global coordination. Answering this question can help us understand the emergence of many communication s...
Jun Wang, Les Gasser, Jim Houk
BPM
2009
Springer
157views Business» more  BPM 2009»
13 years 8 months ago
ProM: The Process Mining Toolkit
Nowadays, all kinds of information systems store detailed information in logs. Examples of such systems include classical workflow management systems (Staffware), ERP systems (SAP)...
Wil M. P. van der Aalst, Boudewijn F. van Dongen, ...
SIGMOD
2010
ACM
201views Database» more  SIGMOD 2010»
13 years 7 months ago
I4E: interactive investigation of iterative information extraction
Information extraction systems are increasingly being used to mine structured information from unstructured text documents. A commonly used unsupervised technique is to build iter...
Anish Das Sarma, Alpa Jain, Divesh Srivastava
IJFCS
2007
105views more  IJFCS 2007»
13 years 7 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean