Sciweavers

1536 search results - page 172 / 308
» Approximately Dominating Representatives
Sort
View
130
Voted
NPAR
2004
ACM
15 years 9 months ago
Rendering complexity in computer-generated pen-and-ink illustrations
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
Brett Wilson, Kwan-Liu Ma
159
Voted
IAT
2003
IEEE
15 years 9 months ago
Asymmetric Multiagent Reinforcement Learning
A gradient-based method for both symmetric and asymmetric multiagent reinforcement learning is introduced in this paper. Symmetric multiagent reinforcement learning addresses the ...
Ville Könönen
129
Voted
ICRA
2003
IEEE
210views Robotics» more  ICRA 2003»
15 years 9 months ago
A truncated least squares approach to the detection of specular highlights in color images
— One of the most difficult aspects of dealing with illumination effects in computer vision is accounting for specularity in the images of real objects. The specular regions in ...
Jae Byung Park, Avinash C. Kak
120
Voted
ICAIL
2003
ACM
15 years 9 months ago
Induction of Defeasible Logic Theories in the Legal Domain
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
Benjamin Johnston, Guido Governatori
114
Voted
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
15 years 9 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin