Sciweavers

189 search results - page 8 / 38
» SCARAB: scaling reachability computation on large graphs
Sort
View
67
Voted
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
14 years 9 months ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
14 years 11 months ago
Radius Plots for Mining Tera-byte Scale Graphs: Algorithms, Patterns, and Observations
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
U. Kang, Charalampos E. Tsourakakis, Ana Paula App...
INFOCOM
2008
IEEE
15 years 4 months ago
Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
Lei Ying, Zhen Liu, Donald F. Towsley, Cathy H. Xi...
ICIP
2010
IEEE
14 years 7 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...
CIKM
2008
Springer
14 years 11 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann