Sciweavers

4498 search results - page 217 / 900
» How to Invent Functions
Sort
View
AIL
2005
99views more  AIL 2005»
15 years 4 months ago
Persuasion Dialogue in Online Dispute Resolution
In this paper we show how dialogue-based theories of argumentation can contribute to the construction of effective systems of dispute resolution. Specifically we consider the role ...
Douglas Walton, David M. Godden
CVPR
2008
IEEE
16 years 6 months ago
Exact inference in multi-label CRFs with higher order cliques
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
Srikumar Ramalingam, Pushmeet Kohli, Karteek Alaha...
SIGGRAPH
1992
ACM
15 years 8 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
146
Voted
NIPS
1993
15 years 5 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 2 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...