Sciweavers

4850 search results - page 390 / 970
» Approximate Data Structures with Applications
Sort
View
HT
1997
ACM
15 years 11 months ago
As We Should Have Thought
The hypermedia field has long realized the need for firstructural abstractions. However, we have failed to generalize the concept of ubiquitous structure management to problem dom...
Peter J. Nürnberg, John J. Leggett, Erich R. ...
VLDB
2005
ACM
118views Database» more  VLDB 2005»
16 years 9 days ago
Selectivity Estimation for Fuzzy String Predicates in Large Data Sets
Many database applications have the emerging need to support fuzzy queries that ask for strings that are similar to a given string, such as “name similar to smith” and “tele...
Liang Jin, Chen Li
ICS
2010
Tsinghua U.
15 years 11 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
APWEB
2007
Springer
15 years 11 months ago
DBMSs with Native XML Support: Towards Faster, Richer, and Smarter Data Management
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
Min Wang
ICML
2005
IEEE
16 years 7 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...