Sciweavers

145 search results - page 7 / 29
» Fast, Randomized Join-Order Selection - Why Use Transformati...
Sort
View
IEAAIE
2003
Springer
14 years 4 months ago
Fast Feature Selection by Means of Projections
The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simple...
Roberto Ruiz, José Cristóbal Riquelm...
ICIP
2006
IEEE
15 years 16 days ago
Multiscale Keypoint Detection using the Dual-Tree Complex Wavelet Transform
We present a novel approach to detect multiscale keypoints using the Dual Tree Complex Wavelet Transform (DTCWT). We show that it is a well-suited basis for this problem as it is ...
Julien Fauqueur, Nick G. Kingsbury, Ryan Anderson
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 11 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
DATE
2009
IEEE
92views Hardware» more  DATE 2009»
14 years 5 months ago
Using randomization to cope with circuit uncertainty
—Future computing systems will feature many cores that run fast, but might show more faults compared to existing CMOS technologies. New software methodologies must be adopted to ...
Hamid Safizadeh, Mohammad Tahghighi, Ehsan K. Arde...
MINENET
2006
ACM
14 years 4 months ago
SVM learning of IP address structure for latency prediction
We examine the ability to exploit the hierarchical structure of Internet addresses in order to endow network agents with predictive capabilities. Specifically, we consider Suppor...
Robert Beverly, Karen R. Sollins, Arthur Berger