Sciweavers

1093 search results - page 190 / 219
» Clustering from Constraint Graphs
Sort
View
ICSOC
2010
Springer
13 years 7 months ago
Automatic Fragment Identification in Workflows Based on Sharing Analysis
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
BCB
2010
138views Bioinformatics» more  BCB 2010»
13 years 4 months ago
Comparative analysis of biclustering algorithms
Biclustering is a very popular method to identify hidden co-regulation patterns among genes. There are numerous biclustering algorithms designed to undertake this challenging task...
Doruk Bozdag, Ashwin S. Kumar, Ümit V. &Ccedi...
MOBIHOC
2006
ACM
14 years 9 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
TVCG
2011
136views more  TVCG 2011»
13 years 4 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 4 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz