Sciweavers

1427 search results - page 254 / 286
» Markov Random Field Modeling in Computer Vision
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Kernel-based Tracking from a Probabilistic Viewpoint
In this paper, we present a probabilistic formulation of kernel-based tracking methods based upon maximum likelihood estimation. To this end, we view the coordinates for the pixel...
Quang Anh Nguyen, Antonio Robles-Kelly, Chunhua Sh...
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
JMLR
2012
11 years 11 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
NSF
2001
Springer
197views Computer Vision» more  NSF 2001»
14 years 1 months ago
A Collaborative Infrastructure for Mobile and Wireless Systems
Today‘s use of mobile phones is mostly for coordination purposes. It seems reasonable to assume that 3G and 4G high bandwidth systems will be used in a similar way. This paper th...
Lutz Michael Wegner, Morad Ahmad, Stefan Fröh...
DCC
2005
IEEE
14 years 8 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye