Sciweavers

1826 search results - page 340 / 366
» Using Random Forests in the Structured Language Model
Sort
View
CAV
2001
Springer
83views Hardware» more  CAV 2001»
15 years 10 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
COMPSAC
1999
IEEE
15 years 10 months ago
Dynamic Software Architecture Slicing
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T....
NIPS
2003
15 years 7 months ago
Phonetic Speaker Recognition with Support Vector Machines
A recent area of significant progress in speaker recognition is the use of high level features—idiolect, phonetic relations, prosody, discourse structure, etc. A speaker not on...
William M. Campbell, Joseph P. Campbell, Douglas A...
ENTCS
2006
109views more  ENTCS 2006»
15 years 5 months ago
Roles as a Coordination Construct: Introducing powerJava
In this paper we apply the role metaphor to coordination. Roles are used in sociology as a way to structure organizations and to coordinate their behavior. In our model, the featu...
Matteo Baldoni, Guido Boella, Leendert W. N. van d...
ACL
2009
15 years 3 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...