Sciweavers

15073 search results - page 307 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
PDP
2006
IEEE
15 years 10 months ago
An Experimental Validation of the PRO Model for Parallel and Distributed Computation
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
Mohamed Essaïdi, Jens Gustedt
ECCC
2011
171views ECommerce» more  ECCC 2011»
14 years 8 months ago
Testing Linear Properties: Some general themes
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
Madhu Sudan
CSDA
2007
127views more  CSDA 2007»
15 years 4 months ago
Computing the least quartile difference estimator in the plane
A common problem in linear regression is that largely aberrant values can strongly influence the results. The least quartile difference (LQD) regression estimator is highly robus...
Thorsten Bernholt, Robin Nunkesser, Karen Schettli...
ACL
2006
15 years 6 months ago
Exact Decoding for Jointly Labeling and Chunking Sequences
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
Nobuyuki Shimizu, Andrew R. Haas
CVPR
2010
IEEE
15 years 4 months ago
Label propagation in video sequences
This paper proposes a probabilistic graphical model for the problem of propagating labels in video sequences, also termed the label propagation problem. Given a limited amount of ...
Vijay Badrinarayanan, Fabio Galasso, Roberto Cipol...