Sciweavers

251 search results - page 48 / 51
» The Graphs with All Subgraphs T-Perfect
Sort
View
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
15 years 5 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
VSTTE
2010
Springer
14 years 10 months ago
To Goto Where No Statement Has Gone Before
Abstract. This paper presents a method for deriving an expression from the lowlevel code compiled from an expression in a high-level language. The input is a low-level control flo...
Michael Barnett, K. Rustan M. Leino
PODC
2009
ACM
16 years 4 days ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
INFOCOM
2008
IEEE
15 years 6 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
MLG
2007
Springer
15 years 5 months ago
Weighted Substructure Mining for Image Analysis
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku K...