Sciweavers

ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 9 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...
TVCG
2008
110views more  TVCG 2008»
13 years 9 months ago
Visibility-driven Mesh Analysis and Visualization through Graph Cuts
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
Kaichi Zhou, Eugene Zhang, Jirí Bittner, Pe...
TSP
2008
105views more  TSP 2008»
13 years 9 months ago
Code-Assisted Synchronization for UWB-IR Systems: Algorithms and Analysis
Timing synchronization is a critical challenge in ultra-wideband impulse radios (UWB-IRs). Conventional fulldigital synchronization methods encounter implementation difficulties su...
Yeqiu Ying, Mounir Ghogho, Ananthram Swami
AEI
2004
150views more  AEI 2004»
13 years 9 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen
TSP
2008
91views more  TSP 2008»
13 years 9 months ago
A Sequential Monte Carlo Method for Motif Discovery
We propose a sequential Monte Carlo (SMC)-based motif discovery algorithm that can efficiently detect motifs in datasets containing a large number of sequences. The statistical di...
Kuo-ching Liang, Xiaodong Wang, Dimitris Anastassi...
TSP
2008
120views more  TSP 2008»
13 years 9 months ago
Distributed Average Consensus With Dithered Quantization
In this paper, we develop algorithms for distributed computation of averages of the node data over networks with bandwidth/power constraints or large volumes of data. Distributed ...
Tuncer C. Aysal, Mark Coates, Michael Rabbat
JPDC
2007
95views more  JPDC 2007»
13 years 9 months ago
Self-stabilizing algorithm for checkpointing in a distributed system
If the variables used for a checkpointing algorithm have data faults, the existing checkpointing and recovery algorithms may fail. In this paper, self-stabilizing data fault detec...
Partha Sarathi Mandal, Krishnendu Mukhopadhyaya
JPDC
2007
191views more  JPDC 2007»
13 years 9 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
TSP
2008
144views more  TSP 2008»
13 years 9 months ago
A New Robust Variable Step-Size NLMS Algorithm
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm o...
Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara...
TSP
2008
89views more  TSP 2008»
13 years 9 months ago
Noncooperative Eigencoding for MIMO Ad hoc Networks
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
Duong A. Hoang, Ronald A. Iltis