Sciweavers

768 search results - page 88 / 154
» Asymptotic Cellular Complexity
Sort
View
ICPP
1992
IEEE
14 years 1 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
CCCG
2008
13 years 10 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
TMC
2011
137views more  TMC 2011»
13 years 3 months ago
Cognitive Medium Access: Exploration, Exploitation, and Competition
— This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wish...
Lifeng Lai, Hesham El Gamal, Hai Jiang, H. Vincent...
PODC
2011
ACM
12 years 11 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ISBI
2006
IEEE
14 years 9 months ago
Towards automated bioimage analysis: from features to semantics
Recent advances in bio-molecular imaging have afforded biologists a more thorough understanding of cellular functions in complex tissue structures. For example, high resolution fl...
B. S. Manjunath, Baris Sumengen, Zhiqiang Bi, Jiyu...