Sciweavers

7648 search results - page 3 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
ICML
2004
IEEE
15 years 10 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik
CC
2003
Springer
15 years 2 months ago
Improving Data Locality by Chunking
Cache memories were invented to decouple fast processors from slow memories. However, this decoupling is only partial, and many researchers have attempted to improve cache use by p...
Cédric Bastoul, Paul Feautrier
IJCV
1998
105views more  IJCV 1998»
14 years 9 months ago
Robust Algorithms for Object Localization
Object localization using sensed data features and corresponding model features is a fundamental problem in machine vision. We reformulate object localization as a least squares p...
Aaron S. Wallack, Dinesh Manocha
84
Voted
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
15 years 10 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
ISCI
2008
102views more  ISCI 2008»
14 years 9 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti