Sciweavers

325 search results - page 27 / 65
» Alternatives to two classic data structures
Sort
View
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
15 years 6 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
15 years 11 months ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
15 years 4 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
TNN
1998
121views more  TNN 1998»
14 years 9 months ago
Detection of mines and minelike targets using principal component and neural-network methods
— This paper introduces a new system for real-time detection and classification of arbitrarily scattered surface-laid mines from multispectral imagery data of a minefield. The ...
Xi Miao, Mahmood R. Azimi-Sadjadi, Bin Tan, A. C. ...
98
Voted
CORR
2000
Springer
120views Education» more  CORR 2000»
14 years 9 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...