Sciweavers

1778 search results - page 333 / 356
» The Theory of Probabilistic Databases
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
DAWAK
2001
Springer
15 years 2 months ago
A Theoretical Framework for Association Mining Based on the Boolean Retrieval Model
Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining is one of the important...
Peter Bollmann-Sdorra, Aladdin Hafez, Vijay V. Rag...
DIMEA
2008
170views Multimedia» more  DIMEA 2008»
14 years 11 months ago
Embodiment in data sculpture: a model of the physical visualization of information
Information is becoming pervasive in the contemporary society, and is increasingly saturating the visual senses and the cognitive efforts of the lay masses. As our attention for v...
Jack Zhao, Andrew Vande Moere
ACL
1994
14 years 11 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
DM
2006
128views more  DM 2006»
14 years 10 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck