Sciweavers

1826 search results - page 318 / 366
» Using Random Forests in the Structured Language Model
Sort
View
NGITS
1993
Springer
15 years 1 months ago
AMOS - An Architecture for Active Mediators
AMOS (Active Mediators Object System) is an architecture to model, locate, search, combine, update, and monitor data in information systems with many work stations connected using...
Gustav Fahl, Tore Risch, Martin Sköld
PRL
2002
94views more  PRL 2002»
14 years 9 months ago
A hierarchical tag-graph search scheme with layered grammar rules for spontaneous speech understanding
It has always been difficult for language understanding systems to handle spontaneous speech with satisfactory robustness, primarily due to such problems as the fragments, disflue...
Bor-shen Lin, Berlin Chen, Hsin-Min Wang, Lin-Shan...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
98
Voted
CSL
2009
Springer
15 years 1 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
CCS
2005
ACM
15 years 3 months ago
Direct chosen ciphertext security from identity-based techniques
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
Xavier Boyen, Qixiang Mei, Brent Waters