Sciweavers

3192 search results - page 267 / 639
» The minimum latency problem
Sort
View
TASE
2010
IEEE
15 years 1 months ago
Sensor Placement for Triangulation-Based Localization
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Onur Tekdas, Volkan Isler
ICASSP
2011
IEEE
14 years 10 months ago
RSS-based sensor localization with unknown transmit power
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
Reza M. Vaghefi, Mohammad Reza Gholami, Erik G. St...
TCS
2010
15 years 4 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
16 years 8 months ago
Finding Time-Lagged 3D Clusters
Existing 3D clustering algorithms on gene ? sample ? time expression data do not consider the time lags between correlated gene expression patterns. Besides, they either ignore the...
Xin Xu, Ying Lu, Kian-Lee Tan, Anthony K. H. Tung