Sciweavers

1094 search results - page 68 / 219
» One Size Fits All
Sort
View
SIAMCOMP
2012
12 years 14 days ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
TEC
2002
161views more  TEC 2002»
13 years 9 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
VIS
2007
IEEE
235views Visualization» more  VIS 2007»
14 years 11 months ago
Efficient Surface Reconstruction using Generalized Coulomb Potentials
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
Andrei C. Jalba, Jos B. T. M. Roerdink
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 10 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 2 months ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last