Sciweavers

11949 search results - page 2337 / 2390
» Some results on (a:b)-choosability
Sort
View
TPDS
1998
92views more  TPDS 1998»
15 years 29 days ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
TASLP
2002
67views more  TASLP 2002»
15 years 29 days ago
Efficient tracking of the cross-correlation coefficient
In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case whe...
Ronald M. Aarts, Roy Irwan, Augustus J. E. M. Jans...
TELSYS
2002
128views more  TELSYS 2002»
15 years 29 days ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo
TON
2002
91views more  TON 2002»
15 years 29 days ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
TPDS
2002
173views more  TPDS 2002»
15 years 29 days ago
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
Stephanie Lindsey, Cauligi S. Raghavendra, Krishna...
« Prev « First page 2337 / 2390 Last » Next »