Sciweavers

2778 search results - page 91 / 556
» Limit complexities revisited
Sort
View
AAAI
2000
15 years 5 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
JCC
2006
58views more  JCC 2006»
15 years 4 months ago
On the reversible O2 binding of the Fe-porphyrin complex
: Electronic mechanism of the reversible O2 binding by heme was studied by using Density Functional Theory calculations. The ground state of oxyheme was calculated to be open singl...
Hiroyuki Nakashima, Jun-Ya Hasegawa, Hiroshi Nakat...
TOG
2008
92views more  TOG 2008»
15 years 4 months ago
Non-homogeneous resizing of complex models
Resizing of 3D models can be very useful when creating new models or placing models inside different scenes. However, uniform scaling is limited in its applicability while straigh...
Vladislav Kraevoy, Alla Sheffer, Ariel Shamir, Dan...
ICIP
2002
IEEE
15 years 9 months ago
Automatic and interactive modeling of buildings in urban environments from aerial images
Automatically extracting object models from images is a complex task. We describe research in extracting 3-D models of buildings from aerial images. This work has resulted in seve...
Ramakant Nevatia, Keith E. Price
COMPGEOM
2010
ACM
15 years 9 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...