5169 search results - page 830 / 1034 » Locality approximation using time |
144
click to vote
DCC
2002
IEEE
16 years 4 months ago
2002
IEEE
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
149
click to vote
IWQOS
2004
Springer
15 years 9 months ago
2004
Springer
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
139
click to vote
IPCO
2010
15 years 6 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
154
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
130
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...