Sciweavers

1538 search results - page 96 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
SODA
2003
ACM
81views Algorithms» more  SODA 2003»
15 years 2 months ago
Smaller explicit superconcentrators
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...
Noga Alon, Michael R. Capalbo
SWAT
2010
Springer
260views Algorithms» more  SWAT 2010»
15 years 6 months ago
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
Stefan Kratsch, Pascal Schweitzer
IJCAI
2003
15 years 2 months ago
Automated Verification: Graphs, Logic, and Automata
Automated verification is one of the most success­ ful applications of automated reasoning in com­ puter science. In automated verification one uses algorithmic techniques to es...
Moshe Y. Vardi
JIB
2006
102views more  JIB 2006»
15 years 1 months ago
3D image and graph based Computation of Protein Surface
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
A. Ranganath, K. C. Shet, N. Vidyavathi
PAMI
2010
396views more  PAMI 2010»
14 years 12 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu