Sciweavers

1798 search results - page 103 / 360
» A Tree for All Seasons
Sort
View
IBPRIA
2007
Springer
14 years 3 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
SRDS
2006
IEEE
14 years 3 months ago
Cryptree: A Folder Tree Structure for Cryptographic File Systems
We present Cryptree, a cryptographic tree structure which facilitates access control in file systems operating on untrusted storage. Cryptree leverages the file system’s folde...
Dominik Grolimund, Luzius Meisser, Stefan Schmid, ...
ISAAC
2005
Springer
89views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Le...
DAWAK
2004
Springer
14 years 2 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 2 months ago
Identifying Markov Blankets with Decision Tree Induction
The Markov Blanket of a target variable is the minimum conditioning set of variables that makes the target independent of all other variables. Markov Blankets inform feature selec...
Lewis Frey, Douglas H. Fisher, Ioannis Tsamardinos...