Sciweavers

3020 search results - page 468 / 604
» Optimal partition trees
Sort
View
MDM
2010
Springer
153views Communications» more  MDM 2010»
15 years 11 months ago
Dessy: Search and Synchronization on the Move
—Current smartphones have a storage capacity of several gigabytes. More and more information is stored on mobile devices. To meet the challenge of information organization, we tu...
Eemil Lagerspetz, Sasu Tarkoma, Tancred Lindholm
DAC
1999
ACM
15 years 10 months ago
Buffer Insertion with Accurate Gate and Interconnect Delay Computation
Buffer insertion has become a critical step in deep submicron design, and several buffer insertion/sizing algorithms have been proposed in the literature. However, most of these m...
Charles J. Alpert, Anirudh Devgan, Stephen T. Quay
ESA
1999
Springer
82views Algorithms» more  ESA 1999»
15 years 10 months ago
Quartet Cleaning: Improved Algorithms and Simulations
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li...
ICCCN
1997
IEEE
15 years 10 months ago
GMNF-DVMRP : A Modified Version of Distance Vector Multicast Routing Protocol
In this paper, we make a survey of Distance Vector Multicast Routing Protocol (DVMRP)andfind that it is not optimal in the aspect of network cost (NC). Therefore, we propose a mod...
Yuan-Cheng Lai, Ying-Dar Lin, Wei-Che Yu, Yuh-Tay ...
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
15 years 10 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...