Sciweavers

20294 search results - page 407 / 4059
» Algorithmic Information Theory
Sort
View
COLT
1999
Springer
15 years 12 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 7 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
WWW
2009
ACM
16 years 8 months ago
Semantic wiki aided business process specification
This paper formulates a collaborative system for modeling business application. The system uses a Semantic Wiki to enable collaboration between the various stakeholders involved i...
Toufeeq Hussain, Rajesh Balakrishnan, Amar Viswana...
MM
2004
ACM
90views Multimedia» more  MM 2004»
16 years 1 months ago
Learning on location with cinematic narratives
This paper describes a narrative-centered approach to learning using location-aware mobile devices, with theories of learning as the basis for a system that utilizes techniques fr...
Kevin Walker
COLING
1992
15 years 8 months ago
On Representing the Temporal Structure of a Natural Language Text
A proposal to deal with tenses in the framework of Discourse Representation Theory is presented, ms it has been implemented for a fragment at the IMS for the project LILOG. It is ...
Kurt Eberle