Sciweavers

9176 search results - page 407 / 1836
» algorithms 2010
Sort
View
GIS
2010
ACM
15 years 4 months ago
Cleaning massive sonar point clouds
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
Lars Arge, Kasper Green Larsen, Thomas Mølh...
DAWAK
2010
Springer
15 years 4 months ago
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
Michael Mampaey
DASFAA
2010
IEEE
158views Database» more  DASFAA 2010»
16 years 1 days ago
DigestJoin: Expediting Joins on Solid-State Drives
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...
Shen Gao, Yu Li, Jianliang Xu, Byron Choi, Haibo H...
ECCC
2010
92views more  ECCC 2010»
15 years 5 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
SIAMCOMP
2010
125views more  SIAMCOMP 2010»
15 years 1 months ago
Approximating Steiner Networks with Node-Weights
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
Zeev Nutov