Sciweavers

2638 search results - page 307 / 528
» Random Geometric Complexes
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 10 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
15 years 8 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
CCCG
2008
15 years 8 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
ALIFE
2007
15 years 6 months ago
Evolution of Birdsong Syntax by Interjection Communication
Animals use diverse forms of communication, from sound signals to body postures. Recent ethological studies have reported a unique syntactic communication of a songbird, the Bengal...
Kazutoshi Sasahara, Takashi Ikegami
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
15 years 6 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang