Sciweavers

4009 search results - page 495 / 802
» Clustering on Complex Graphs
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Experience in using a process language to define scientific workflow and generate dataset provenance
This paper describes our experiences in exploring the applicability of software engineering approaches to scientific data management problems. Specifically, this paper describes h...
Leon J. Osterweil, Lori A. Clarke, Aaron M. Elliso...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
ICDCS
2009
IEEE
16 years 3 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ICCD
2003
IEEE
127views Hardware» more  ICCD 2003»
16 years 3 months ago
Structural Detection of Symmetries in Boolean Functions
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
Guoqiang Wang, Andreas Kuehlmann, Alberto L. Sangi...
183
Voted
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker