Sciweavers

217 search results - page 16 / 44
» Deterministic Algorithm for the t-Threshold Set Problem
Sort
View
JSAC
2008
98views more  JSAC 2008»
13 years 7 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
CEC
2005
IEEE
14 years 1 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
ICALP
2003
Springer
14 years 27 days ago
Solving the Robots Gathering Problem
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe...
VLDB
1997
ACM
66views Database» more  VLDB 1997»
13 years 11 months ago
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
Khaled Alsabti, Sanjay Ranka, Vineet Singh
ICIP
2005
IEEE
14 years 9 months ago
Off-line multiple object tracking using candidate selection and the Viterbi algorithm
This paper presents a probabilistic framework for off-line multiple object tracking. At each timestep, a small set of deterministic candidates is generated which is guaranteed to ...
Anil C. Kokaram, François Pitié, Roz...