Sciweavers

1594 search results - page 43 / 319
» Fast Prediction on a Tree
Sort
View
132
Voted
ACL
1997
15 years 5 months ago
Learning Features that Predict Cue Usage
Our goal is to identify the features that predict the occurrence and placement of discourse cues in tutorial explanations in order to aid in the automatic generation of explanatio...
Barbara Di Eugenio, Johanna D. Moore, Massimo Paol...
124
Voted
TOIS
2002
97views more  TOIS 2002»
15 years 3 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
126
Voted
SCAM
2007
IEEE
15 years 10 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
158
Voted
JCP
2006
232views more  JCP 2006»
15 years 3 months ago
Indexing of Motion Capture Data for Efficient and Fast Similarity Search
As motion capture systems are increasingly used for motion tracking and capture, and more and more surveillance cameras are installed for security protection, more and more motion ...
Chuanjun Li, B. Prabhakaran
98
Voted
ICML
2006
IEEE
16 years 4 months ago
Fast particle smoothing: if I had a million particles
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
Mike Klaas, Mark Briers, Nando de Freitas, Arnaud ...