Sciweavers

434 search results - page 41 / 87
» sum 2007
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
Anna Gál, Parikshit Gopalan
ICC
2007
IEEE
136views Communications» more  ICC 2007»
14 years 2 months ago
Applying The Balanced Capacity Concept to DSL Systems
— This paper investigates a fair resource allocation method in crosstalk limited DSL (Digital Subscriber Line) systems. As a measure of fairness, the concept of Balanced Capacity...
Ali Kalakech, Jérôme Louveaux, Luc Va...
WCE
2007
13 years 8 months ago
Models of Adding Relations to a Linking Pin Type Organization Structure
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
Kiyoshi Sawada
CVPR
2007
IEEE
14 years 9 months ago
On-line Simultaneous Learning and Tracking of Visual Feature Graphs
Model learning and tracking are two important topics in computer vision. While there are many applications where one of them is used to support the other, there are currently only...
Arnaud Declercq, Justus H. Piater
ICIP
2007
IEEE
14 years 9 months ago
Statistically Driven Sparse Image Approximation
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
Rosa M. Figueras i Ventura, Eero P. Simoncelli