Sciweavers

82 search results - page 2 / 17
» Trans-Dichotomous Algorithms Without Multiplication - Some U...
Sort
View
EDBT
2006
ACM
145views Database» more  EDBT 2006»
14 years 7 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
COCOON
2005
Springer
14 years 1 months ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
TSP
2008
119views more  TSP 2008»
13 years 7 months ago
MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
Chan-Byoung Chae, Taiwen Tang, Robert W. Heath Jr....
PODC
2003
ACM
14 years 25 days ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
WDAG
1992
Springer
104views Algorithms» more  WDAG 1992»
13 years 11 months ago
Choice Coordination with Multiple Alternatives (Preliminary Version)
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang