4526 search results - page 564 / 906 » Algorithmic problems related to the Internet |
285
click to vote
STOC
1997
ACM
15 years 11 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
165
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. Humans demonstrate a remarkable ability to parse complicated motion sequences into their constituent structures and motions. We investigate this problem, attempting to le...
166
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
Interactive image segmentation is a powerful paradigm that allows users to direct the segmentation algorithm towards a desired output. However, marking scribbles on multiple image...
172
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good resu...
190
click to vote
LFCS
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...