Sciweavers

2107 search results - page 349 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
AIRWEB
2007
Springer
14 years 3 months ago
Splog Detection Using Self-similarity Analysis on Blog Temporal Dynamics
This paper focuses on spam blog (splog) detection. Blogs are highly popular, new media social communication mechanisms. The presence of splogs degrades blog search results as well...
Yu-Ru Lin, Hari Sundaram, Yun Chi, Jun'ichi Tatemu...
ASPLOS
2010
ACM
14 years 8 days ago
Micro-pages: increasing DRAM efficiency with locality-aware data placement
Power consumption and DRAM latencies are serious concerns in modern chip-multiprocessor (CMP or multi-core) based compute systems. The management of the DRAM row buffer can signif...
Kshitij Sudan, Niladrish Chatterjee, David Nellans...
RIVF
2003
13 years 10 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
CCGRID
2008
IEEE
14 years 3 months ago
Using Dynamic Condor-Based Services for Classifying Schizophrenia in Diffusion Tensor Images
— Diffusion Tensor Imaging (DTI) provides insight into the white matter of the human brain, which is affected by Schizophrenia. By comparing a patient group to a control group, t...
Simon Caton, Matthan Caan, Sílvia Delgado O...