Sciweavers

7228 search results - page 534 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 11 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
ICPR
2004
IEEE
16 years 8 months ago
Visual Learning and Recognition of a Probabilistic Spatio-Temporal Model of Cyclic Human Locomotion
We present a novel representation of cyclic human locomotion based on a set of spatio-temporal curves of tracked points on the surface of a person. We start by extracting a set of...
Miha Peternel, Ales Leonardis
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
16 years 7 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman
NIPS
2004
15 years 8 months ago
Common-Frame Model for Object Recognition
A generative probabilistic model for objects in images is presented. An object consists of a constellation of features. Feature appearance and pose are modeled probabilistically. ...
Pierre Moreels, Pietro Perona
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 7 months ago
On Functional Decomposition of Multivariate Polynomials with Differentiation and Homogenization
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
Shang-Wei Zhao, Ruyong Feng, Xiao-Shan Gao