Sciweavers

192 search results - page 28 / 39
» On Graph Isomorphism for Restricted Graph Classes
Sort
View
100
Voted
ICCV
1999
IEEE
16 years 1 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 6 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
ECCC
2006
145views more  ECCC 2006»
14 years 11 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
SOFTVIS
2003
ACM
15 years 4 months ago
Nice Class Diagrams Admit Good Design?
Analysis and design of programs by using tools has emerged to a standard technique in object-oriented software engineering. Many of these tools claim to implement methods accordin...
Holger Eichelberger
TMC
2008
127views more  TMC 2008»
14 years 11 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik