661 search results - page 53 / 133 » Levels of a scale-free tree |
154
click to vote
EURODAC
1995
IEEE
15 years 9 months ago
1995
IEEE
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...
147
click to vote
COLING
1992
15 years 6 months ago
1992
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...
145
click to vote
VISSYM
2004
15 years 7 months ago
2004
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...
147
click to vote
COCO
2009
Springer
15 years 9 months ago
2009
Springer
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 ...
145
click to vote
FIMI
2004
15 years 7 months ago
2004
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...