Sciweavers

715 search results - page 80 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
IOR
2006
75views more  IOR 2006»
14 years 12 months ago
Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
Ward Whitt
TASLP
2008
120views more  TASLP 2008»
14 years 11 months ago
Rapid Speaker Adaptation Using Clustered Maximum-Likelihood Linear Basis With Sparse Training Data
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
Yun Tang, Richard Rose
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 1 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 1 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
DEXA
2008
Springer
87views Database» more  DEXA 2008»
15 years 1 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...