Sciweavers

3708 search results - page 48 / 742
» Approximating Betweenness Centrality
Sort
View
ISSADS
2005
Springer
14 years 4 months ago
Model Fragmentation for Distributed Workflow Execution: A Petri Net Approach
Workflow is the key technology for business process automation, while distributed workflow is the solution to deal with the decentralized nature of workflow applications and the pe...
Wei Tan, Yushun Fan
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
14 years 4 months ago
A Hop Constrained Min-Sum Arborescence with Outage Costs
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
Rakesh Kawatra
EMNLP
2004
14 years 12 days ago
LexPageRank: Prestige in Multi-Document Text Summarization
Multidocument extractive summarization relies on the concept of sentence centrality to identify the most important sentences in a document. Centrality is typically defined in term...
Günes Erkan, Dragomir R. Radev
JMLR
2006
105views more  JMLR 2006»
13 years 11 months ago
Expectation Correction for Smoothed Inference in Switching Linear Dynamical Systems
We introduce a method for approximate smoothed inference in a class of switching linear dynamical systems, based on a novel form of Gaussian Sum smoother. This class includes the ...
David Barber
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 9 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu