Sciweavers

933 search results - page 70 / 187
» Monotone Complexity of a Pair
Sort
View
CVPR
2008
IEEE
14 years 11 months ago
Sparse probabilistic regression for activity-independent human pose inference
Discriminative approaches to human pose inference involve mapping visual observations to articulated body configurations. Current probabilistic approaches to learn this mapping ha...
Raquel Urtasun, Trevor Darrell
ISBI
2004
IEEE
14 years 9 months ago
Iterative Image Reconstruction in MRI With Separate Magnitude and Phase Regularization
Iterative methods for image reconstruction in MRI are useful in several applications, including reconstruction from non-Cartesian k-space samples, compensation for magnetic field ...
Jeffrey A. Fessler, Douglas C. Noll
PODC
2009
ACM
14 years 9 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 9 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 9 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis