Sciweavers

80 search results - page 1 / 16
» Towards an Optimal Algorithm for Recognizing Laman Graphs
Sort
View
HICSS
2009
IEEE
122views Biometrics» more  HICSS 2009»
14 years 5 months ago
Towards an Optimal Algorithm for Recognizing Laman Graphs
Ovidiu Daescu, Anastasia Kurdia
DAM
2007
105views more  DAM 2007»
13 years 10 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 3 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
PRL
2002
91views more  PRL 2002»
13 years 10 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen
INFOCOM
2010
IEEE
13 years 9 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...