Sciweavers

1402 search results - page 193 / 281
» Sparse-Memory Graph Search
Sort
View
129
Voted
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 2 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
93
Voted
TCAD
2008
75views more  TCAD 2008»
15 years 2 months ago
An Efficient Graph-Based Algorithm for ESD Current Path Analysis
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
Chih-Hung Liu, Hung-Yi Liu, Chung-Wei Lin, Szu-Jui...
DIAGRAMS
2008
Springer
15 years 4 months ago
Diagrammatic Logic of Existential Graphs: A Case Study of Commands
Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as...
Ahti-Veikko Pietarinen
118
Voted
SIGIR
2008
ACM
15 years 2 months ago
A general optimization framework for smoothing language models on graph structures
Recent work on language models for information retrieval has shown that smoothing language models is crucial for achieving good retrieval performance. Many different effective smo...
Qiaozhu Mei, Duo Zhang, ChengXiang Zhai
121
Voted
AI
2010
Springer
15 years 2 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon