Sciweavers

672 search results - page 75 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
77
Voted
AAAI
2008
15 years 2 months ago
Efficient Learning of Action Schemas and Web-Service Descriptions
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
Thomas J. Walsh, Michael L. Littman
IUI
2004
ACM
15 years 6 months ago
Leafing digital content
Today the availability of large digital content archives (video, ebook, audio) creates many problems in terms of user interaction and data manipulation (browsing, searching). Many...
A. Barletta, M. Mayer, B. Moser
113
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 26 days ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
106
Voted
CVPR
2010
IEEE
15 years 3 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
IPPS
2008
IEEE
15 years 7 months ago
Automatic middleware deployment planning on heterogeneous platforms
Abstract— The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalabili...
Pushpinder-Kaur Chouhan, Eddy Caron, Fréd&e...