Sciweavers

469 search results - page 49 / 94
» Edges as Nodes - a New Approach to Timetable Information
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
14 years 2 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
CORR
2011
Springer
223views Education» more  CORR 2011»
13 years 2 months ago
Decentralized Formation Control Part I: Geometric Aspects
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
Mohamed-Ali Belabbas
ICPR
2002
IEEE
14 years 17 days ago
Near-Optimal Regularization Parameters for Applications in Computer Vision
Computer vision requires the solution of many ill-posed problems such as optical flow, structure from motion, shape from shading, surface reconstruction, image restoration and ed...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
LREC
2010
197views Education» more  LREC 2010»
13 years 9 months ago
Automatic Annotation of Co-Occurrence Relations
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
Dirk Goldhahn, Uwe Quasthoff