Sciweavers

336 search results - page 18 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
INFOCOM
2008
IEEE
14 years 1 months ago
Network Routing Topology Inference from End-to-End Measurements
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...
BCB
2010
166views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...
HPCA
2007
IEEE
14 years 7 months ago
Implications of Device Timing Variability on Full Chip Timing
As process technologies continue to scale, the magnitude of within-die device parameter variations is expected to increase and may lead to significant timing variability. This pap...
Murali Annavaram, Ed Grochowski, Paul Reed