4850 search results - page 631 / 970 » Approximate Data Structures with Applications |
180
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
161
click to vote
WSC
2008
15 years 8 months ago
2008
In this tutorial we present techniques for building valid and credible simulation models. Ideas to be discussed include the importance of a definitive problem formulation, discuss...
166
click to vote
ACL
2007
15 years 8 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
158
click to vote
LREC
2010
15 years 8 months ago
2010
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
179
click to vote
NIPS
2007
15 years 7 months ago
2007
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...