Sciweavers

725 search results - page 44 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
15 years 4 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
15 years 11 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
15 years 2 months ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 2 days ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
NIPS
2008
14 years 11 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas