Sciweavers

2503 search results - page 418 / 501
» A study of 3-arc graphs
Sort
View
CGO
2008
IEEE
14 years 4 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
FOCS
2008
IEEE
14 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICCCN
2008
IEEE
14 years 4 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz
ICDM
2008
IEEE
150views Data Mining» more  ICDM 2008»
14 years 4 months ago
Pseudolikelihood EM for Within-network Relational Learning
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
Rongjing Xiang, Jennifer Neville
ICRA
2008
IEEE
471views Robotics» more  ICRA 2008»
14 years 4 months ago
Autonomous image-based exploration for mobile robot navigation
— Image-based navigation paradigms have recently emerged as an interesting alternative to conventional modelbased methods in mobile robotics. In this paper, we augment the existi...
D. Santosh, Supreeth Achar, C. V. Jawahar