Sciweavers

580 search results - page 86 / 116
» Choosing a random peer
Sort
View
CVPR
2004
IEEE
16 years 1 months ago
On the Distribution of Saliency
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...
Alexander Berengolts, Michael Lindenbaum
ICIP
2005
IEEE
16 years 1 months ago
Sampling in practice: is the best reconstruction space bandlimited?
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant " space, ...
Sathish Ramani, Dimitri Van De Ville, Michael Unse...
ICML
2007
IEEE
16 years 21 days ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
ICML
2006
IEEE
16 years 21 days ago
Active sampling for detecting irrelevant features
The general approach for automatically driving data collection using information from previously acquired data is called active learning. Traditional active learning addresses the...
Sriharsha Veeramachaneni, Emanuele Olivetti, Paolo...
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
16 years 1 days ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...