Sciweavers

423 search results - page 60 / 85
» Topology for Distributed Inference on Graphs
Sort
View
COMPGEOM
2004
ACM
15 years 5 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
SPAA
1999
ACM
15 years 4 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
15 years 5 months ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...
ATAL
2007
Springer
15 years 3 months ago
Workflow coordination for service-oriented multiagent systems
From a multiagent viewpoint, a workflow is a dynamic set of tasks performed by a set of agents to reach a shared goal. We show herein that commitments among agents can be used to ...
Jiangbo Dang, Jingshan Huang, Michael N. Huhns
SECON
2007
IEEE
15 years 6 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha