Sciweavers

4541 search results - page 505 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
IJCAI
2007
15 years 7 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
NIPS
2004
15 years 7 months ago
An Application of Boosting to Graph Classification
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
Taku Kudo, Eisaku Maeda, Yuji Matsumoto
157
Voted
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 7 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
WCE
2007
15 years 7 months ago
MR Image Reconstruction from Pseudo-Hex Lattice Sampling Patterns Using Separable FFT
Abstract— Common MRI sampling patterns in kspace, such as spiral trajectories, have nonuniform density and do not lie on a rectangular grid. We propose mapping the sampled data t...
Jae-Ho Kim, Fred L. Fontaine
JMLR
2000
134views more  JMLR 2000»
15 years 6 months ago
Learning with Mixtures of Trees
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
Marina Meila, Michael I. Jordan