Sciweavers

5329 search results - page 10 / 1066
» The Weighted Majority Algorithm
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 7 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
GD
2005
Springer
14 years 1 months ago
Stress Majorization with Orthogonal Ordering Constraints
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
Tim Dwyer, Yehuda Koren, Kim Marriott
BMEI
2008
IEEE
14 years 2 months ago
Discovering Multi-dimensional Major Medicines from Traditional Chinese Medicine Prescriptions
Multi-dimensional major medicines analysis is one of the most important tasks in the data analysis of Traditional Chinese Medicine (TCM) prescriptions. In this paper, an effective...
Chuan Li, Changjie Tang, Chunqiu Zeng, Jiang Wu, Y...
BMCBI
2007
265views more  BMCBI 2007»
13 years 7 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
ECCC
2010
108views more  ECCC 2010»
13 years 4 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...