Sciweavers

2519 search results - page 121 / 504
» Martingales and Locality in Distributed Computing
Sort
View
JCNS
2010
119views more  JCNS 2010»
13 years 7 months ago
Disentanglement of local field potential sources by independent component analysis
The spontaneous activity of working neurons yields synaptic currents that mix up in the volume conductor. This activity is picked up by intracerebral recording electrodes as local ...
Valeri A. Makarov, Ioulia Makarova, Oscar Herreras
WWW
2009
ACM
14 years 9 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
TMC
2010
138views more  TMC 2010»
13 years 7 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
IM
2007
13 years 8 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith