Sciweavers

683 search results - page 24 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
14 years 2 months ago
Dynamical structure analysis of sparsity and minimality heuristics for reconstruction of biochemical networks
— Network reconstruction, i.e. obtaining network structure from input-output information, is a central theme in systems biology. A variety of approaches aim to obtaining structur...
Russell Howes, Lee John Eccleston, Jorge M. Goncal...
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
ICML
2006
IEEE
14 years 8 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
INFOCOM
2007
IEEE
14 years 2 months ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
KDD
2012
ACM
164views Data Mining» more  KDD 2012»
11 years 10 months ago
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
Jeffrey Chan, Wei Liu, Christopher Leckie, James B...