Sciweavers

4865 search results - page 598 / 973
» The Complexity of Graph Connectivity
Sort
View
ICDCS
2009
IEEE
16 years 4 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...
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
IV
2009
IEEE
107views Visualization» more  IV 2009»
16 years 1 months ago
Multiscale Visual Analysis of Lexical Networks
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
Guillaume Artignan, Mountaz Hascoët, Mathieu ...
SEMWEB
2009
Springer
16 years 1 months ago
XLWrap - Querying and Integrating Arbitrary Spreadsheets with SPARQL
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
Andreas Langegger, Wolfram Wöß