Sciweavers

8728 search results - page 355 / 1746
» On Reduct Construction Algorithms
Sort
View
TON
2008
89views more  TON 2008»
15 years 5 months ago
Simple summaries for hashing with choices
In a multiple-choice hashing scheme, each item is stored in one of 2 possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in t...
Adam Kirsch, Michael Mitzenmacher
ALMOB
2007
129views more  ALMOB 2007»
15 years 7 months ago
Consistency of the Neighbor-Net Algorithm
Background: Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an inp...
David Bryant, Vincent Moulton, Andreas Spillner
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
16 years 9 days ago
Optimal Integer Alphabetic Trees in Linear Time
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
ISPD
2009
ACM
79views Hardware» more  ISPD 2009»
16 years 1 months ago
A routing approach to reduce glitches in low power FPGAs
Glitches (spurious transitions) are common in electronic circuits. In this paper we present a novel approach to reduce dynamic power in FPGAs by reducing glitches during the routi...
Quang Dinh, Deming Chen, Martin D. F. Wong
CODES
2003
IEEE
16 years 2 days ago
A low power scheduler using game theory
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...
N. Ranganathan, Ashok K. Murugavel