Sciweavers

1396 search results - page 191 / 280
» Succinct Dynamic Data Structures
Sort
View
INFOCOM
2007
IEEE
15 years 7 months ago
Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks
— Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to imp...
Xiaojing Xiang, Zehua Zhou, Xin Wang
JLP
2006
155views more  JLP 2006»
15 years 1 months ago
A formally grounded software specification method
One of the goals of software engineering is to provide what is necessary to write relevant, legible, useful descriptions of the systems to be developed, which will be the basis of...
Christine Choppy, Gianna Reggio
EUROPAR
2001
Springer
15 years 5 months ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor
ISBI
2006
IEEE
16 years 2 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...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 10 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu