Sciweavers

4498 search results - page 203 / 900
» How to Invent Functions
Sort
View
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 7 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
CVPR
2010
IEEE
16 years 2 months ago
Learning Shift-Invariant Sparse Representation of Actions
A central problem in the analysis of motion capture (Mo- Cap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should fac...
Yi Li
CVPR
2010
IEEE
16 years 2 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar
DASFAA
2010
IEEE
179views Database» more  DASFAA 2010»
16 years 1 months ago
Scalable Splitting of Massive Data Streams
Scalable execution of continuous queries over massive data streams often requires splitting input streams into parallel sub-streams over which query operators are executed in paral...
Erik Zeitler, Tore Risch
CIE
2009
Springer
16 years 1 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée