Sciweavers

205 search results - page 29 / 41
» Grid Graph Reachability Problems
Sort
View
CONEXT
2010
ACM
14 years 9 months ago
Assessing the vulnerability of replicated network services
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
George Dean Bissias, Brian Neil Levine, Ramesh K. ...
SPAA
2006
ACM
15 years 5 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
92
Voted
CSL
2009
Springer
15 years 5 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
78
Voted
ICSE
2010
IEEE-ACM
15 years 3 months ago
Codebook: discovering and exploiting relationships in software repositories
Large-scale software engineering requires communication and collaboration to successfully build and ship products. We conducted a survey with Microsoft engineers on inter-team coo...
Andrew Begel, Yit Phang Khoo, Thomas Zimmermann
ECCV
2006
Springer
16 years 1 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother