Sciweavers

1857 search results - page 111 / 372
» Minimum Degree Orderings
Sort
View
AB
2007
Springer
15 years 10 months ago
Prefix Reversals on Binary and Ternary Strings
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...
SUTC
2010
IEEE
15 years 10 months ago
Link Scheduling in a Single Broadcast Domain Underwater Networks
Because radio waves decay rapidly in sea water, acoustic communication is the most popular choic for underwater sensor networks. However, since the propagation speed of acoustic w...
Pai-Han Huang, Ying Chen, Bhaskar Krishnamachari, ...
ICML
2010
IEEE
15 years 7 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
TIT
2008
103views more  TIT 2008»
15 years 6 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
RECOMB
2010
Springer
15 years 4 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff