Sciweavers

661 search results - page 53 / 133
» Levels of a scale-free tree
Sort
View
EURODAC
1995
IEEE
126views VHDL» more  EURODAC 1995»
14 years 1 months ago
Timing optimization by bit-level arithmetic transformations
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...
Luc Rijnders, Zohair Sahraoui, Paul Six, Hugo De M...
COLING
1992
13 years 10 months ago
Term-Rewriting As A Basis For A Uniform Architecture In Machine Translation
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
Wilhelm Weisweber
VISSYM
2004
13 years 11 months ago
A Botanically Inspired High-Dimensional Visualization with Multivariate Glyphs
It is difficult for the average viewer to assimilate and comprehend huge amounts of high-dimensional data. It is important to present data in a way that allows the user a high lev...
Eleanor Boyle Chlan, Penny Rheingans
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 1 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
FIMI
2004
134views Data Mining» more  FIMI 2004»
13 years 11 months ago
Recursion Pruning for the Apriori Algorithm
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...
Christian Borgelt