Sciweavers

2520 search results - page 167 / 504
» The complexity of approximating entropy
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto
JCP
2006
120views more  JCP 2006»
14 years 11 months ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
ICIP
2010
IEEE
14 years 9 months ago
Mixed-resolution distributed video codec without motion estimation at the encoder
Inspired by recent results showing that Wyner-Ziv coding using a combination of source and channel coding may be more efficient than pure channel coding, we have applied coset cod...
Bruno Macchiavello, Edson M. Hung, Ricardo L. de Q...
FOCM
2008
76views more  FOCM 2008»
14 years 11 months ago
On Smale's 17th Problem: A Probabilistic Positive Solution
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
Carlos Beltrán, Luis Miguel Pardo
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
15 years 11 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal