Sciweavers

12 search results - page 2 / 3
» Upper and Lower Grey-Level Adaptive Morphological Operators
Sort
View
TSP
2008
119views more  TSP 2008»
13 years 10 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....
ICALP
2007
Springer
14 years 5 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
SIBGRAPI
2007
IEEE
14 years 5 months ago
Dental Biometrics: Human Identification Based On Dental Work Information
Dental biometrics is used in forensic dentistry to identify or verify persons based on their dental radiographs. This paper presents a method for human identification based on den...
Michael Hofer, Aparecido Nilceu Marana
SPAA
1993
ACM
14 years 2 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 11 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah