Sciweavers

1662 search results - page 240 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
NORDICHI
2006
ACM
14 years 2 months ago
Tabletop interaction: research alert
At the t2i Lab we focus on tangible user interfaces (TUIs) to advance and improve the user experience in computer supported learning and problem solving. By directly interacting w...
Wolfgang Mähr, Richard Carlsson, Jonas Fredri...
LCPC
2005
Springer
14 years 2 months ago
Dynamic Compilation for Reducing Energy Consumption of I/O-Intensive Applications
Tera-scale high-performance computing has enabled scientists to tackle very large and computationally challenging scientific problems, making the advancement of scientific discov...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir, A...
SC
2009
ACM
14 years 3 months ago
Using dynamic accounts to enable access to advanced resources through science gateways
Science Gateways have emerged as a valuable solution for providing large numbers of users with access to advanced computing resources. Additionally, they can hide many of the comp...
Joseph A. Insley, Ti Leggett, Michael E. Papka
CVPR
2011
IEEE
13 years 4 months ago
A Global Sampling Method for Alpha Matting
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
Kaiming He, Christoph Rhemann, Carsten Rother, Xia...