Sciweavers

320 search results - page 31 / 64
» A New Compression Method with Fast Searching on Large Databa...
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 8 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
FCCM
2004
IEEE
130views VLSI» more  FCCM 2004»
14 years 7 days ago
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
Sebastian Lange, Martin Middendorf
ICML
2001
IEEE
14 years 9 months ago
Learning to Generate Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 8 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
BMCBI
2005
132views more  BMCBI 2005»
13 years 8 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer