2430 search results - page 315 / 486 » Computing Tutte Polynomials |
155
Voted
ICCV
2003
IEEE
15 years 9 months ago
2003
IEEE
Many of the computer vision algorithms have been posed in various forms of differential equations, derived from minimization of specific energy functionals, and the finite eleme...
148
Voted
FCT
2009
Springer
15 years 7 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
109
Voted
SIGGRAPH
1995
ACM
15 years 7 months ago
1995
ACM
We present new techniques for computing illumination from non-diffuse luminaires and scattering from non-diffuse surfaces. The methods are based on new closed-form expressions d...
136
Voted
UAI
2004
15 years 5 months ago
2004
We introduce the study of sequential information elicitation in strategic multi-agent systems. In an information elicitation setup a center attempts to compute the value of a func...
146
Voted
EJC
2008
15 years 3 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...