Sciweavers

3220 search results - page 331 / 644
» Constrained Graph Processes
Sort
View
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
16 years 19 days ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...
ICDCS
2005
IEEE
16 years 7 days ago
Resource-Aware Distributed Stream Management Using Dynamic Overlays
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
Vibhore Kumar, Brian F. Cooper, Zhongtang Cai, Gre...
150
Voted
ICNP
2000
IEEE
15 years 11 months ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
CONCURRENCY
2006
112views more  CONCURRENCY 2006»
15 years 6 months ago
Implementing BPEL4WS: the architecture of a BPEL4WS implementation
e a set of very distinctive abstractions that result in significant modifications of the basic workflow model as outlined in pre-existing workflow model, see [2] for example. In pa...
Francisco Curbera, Rania Khalaf, William Nagy, San...