Sciweavers

360 search results - page 57 / 72
» Precision-at-ten considered redundant
Sort
View
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
TSP
2008
69views more  TSP 2008»
13 years 7 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
ENTCS
2002
148views more  ENTCS 2002»
13 years 7 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
13 years 7 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
TIP
2002
126views more  TIP 2002»
13 years 7 months ago
Multiframe error concealment for MPEG-coded video delivery over error-prone networks
Compressed video sequences are very vulnerable to channel disturbances when they are transmitted through an unreliable medium such as a wireless channel. Transmission errors not on...
Yen-Chi Lee, Yucel Altunbasak, Russell M. Merserea...