Sciweavers

740 search results - page 97 / 148
» An approximation ratio for biclustering
Sort
View
FCS
2008
15 years 1 months ago
Autonomous Scheduling
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
Chetan Yadati, Cees Witteveen, Yingqian Zhang, Men...
SNPD
2007
15 years 1 months ago
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 28 days ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali
ICASSP
2010
IEEE
15 years 1 days ago
Noise robust exemplar-based connected digit recognition
This paper proposes a noise robust exemplar-based speech recognition system where noisy speech is modeled as a linear combination of a set of speech and noise exemplars. The metho...
Jort F. Gemmeke, Tuomas Virtanen
ANOR
2006
64views more  ANOR 2006»
14 years 12 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz