Sciweavers

308 search results - page 60 / 62
» Competing Patterns for Language Engineering
Sort
View
FOSSACS
2011
Springer
12 years 11 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
PLDI
2003
ACM
14 years 22 days ago
Bug isolation via remote program sampling
We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program’s user community. Several example applications illustrat...
Ben Liblit, Alexander Aiken, Alice X. Zheng, Micha...
SIGIR
2003
ACM
14 years 22 days ago
Table extraction using conditional random fields
The ability to find tables and extract information from them is a necessary component of data mining, question answering, and other information retrieval tasks. Documents often c...
David Pinto, Andrew McCallum, Xing Wei, W. Bruce C...
AND
2009
13 years 5 months ago
Accessing the content of Greek historical documents
In this paper, we propose an alternative method for accessing the content of Greek historical documents printed during the 17th and 18th centuries by searching words directly in d...
Anastasios L. Kesidis, Eleni Galiotou, Basilios Ga...
ICWS
2009
IEEE
14 years 4 months ago
Service Supervision: Coordinating Web Services in Open Environment
ite Web service designed based on abstract Web services, which define only interfaces, allows an application developer to select services required for his application only by set...
Masahiro Tanaka, Toru Ishida, Yohei Murakami, Sato...