Sciweavers

7228 search results - page 163 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CIKM
2010
Springer
15 years 2 months ago
A method for discovering components of human rituals from streams of sensor data
This paper describes an algorithm for determining if an event occurs persistently within an interval where the interval is periodic but the event is not. The goal of the algorithm...
Athanasios Bamis, Jia Fang, Andreas Savvides
CVPR
2009
IEEE
16 years 10 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 3 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
119
Voted
SIGIR
2006
ACM
15 years 9 months ago
Learning a ranking from pairwise preferences
We introduce a novel approach to combining rankings from multiple retrieval systems. We use a logistic regression model or an SVM to learn a ranking from pairwise document prefere...
Ben Carterette, Desislava Petkova
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson