Sciweavers

13603 search results - page 184 / 2721
» On the Complexity of Computing Treelength
Sort
View
COCOON
2009
Springer
15 years 11 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
AAAI
2004
15 years 5 months ago
AI Characters and Directors for Interactive Computer Games
We are creating an environment for investigating the role of advanced AI in interactive, story-based computer games. This environment is based on the Unreal Tournament (UT) game e...
Brian Magerko, John E. Laird, Mazin Assanie, Alex ...
CVPR
2001
IEEE
16 years 6 months ago
Automatic Description of Buildings with Complex Rooftops from Multiple Images
We present a model-based approach to detecting and describing compositions of buildings with complex rooftops. Previous approaches have dealt with either simpler models or models ...
Zu Whan Kim, Andres Huertas, Ramakant Nevatia
ICCS
2007
Springer
15 years 10 months ago
Complexity of Monte Carlo Algorithms for a Class of Integral Equations
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
Ivan Dimov, Rayna Georgieva
CGI
1998
IEEE
15 years 8 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...