Sciweavers

1709 search results - page 215 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
PAMI
2011
15 years 1 months ago
Revisiting Linear Discriminant Techniques in Gender Recognition
—Emerging applications of computer vision and pattern recognition in mobile devices and networked computing require the development of resourcelimited algorithms. Linear classifi...
Juan Bekios-Calfa, José Miguel Buenaposada,...
KDD
2007
ACM
209views Data Mining» more  KDD 2007»
16 years 6 months ago
Temporal causal modeling with graphical granger methods
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data...
Andrew Arnold, Yan Liu, Naoki Abe
PVLDB
2011
14 years 9 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
DELOS
2000
15 years 7 months ago
Analysis of the Effectiveness-Efficiency Dependence for Image Retrieval
Similarity search in image database is commonly implemented as nearest-neighbor search in a feature space of the images. For that purpose, a large number of different features as ...
Martin Heczko, Daniel A. Keim, Roger Weber
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 6 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos