Sciweavers

4372 search results - page 284 / 875
» Algorithmic Theories of Everything
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 4 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
ICIP
2009
IEEE
15 years 3 months ago
Computational primitives of visual perception
Great stride has been made in psychological research about primitives of visual perception, which is important to computer vision and image processing. In this paper, we propose a...
Yongzhen Huang, Kaiqi Huang, Tieniu Tan
FOCM
2011
96views more  FOCM 2011»
14 years 9 months ago
Persistent Intersection Homology
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
Paul Bendich, John Harer
ICSE
2011
IEEE-ACM
14 years 9 months ago
Pragmatic reuse in web application development
Highly interactive web applications that offer user experience and responsiveness of desktop applications are becoming increasingly popular. They are often composed out of visual...
Josip Maras

Publication
519views
14 years 4 months ago
The Finite Volume, Finite Difference, and Finite Elements Methods as Numerical Methods for Physical Field Problems
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi