3758 search results - page 200 / 752 » A Complete Subsumption Algorithm |
124
click to vote
GOSLER
1995
15 years 5 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
122
Voted
WSCG
2003
15 years 3 months ago
2003
We present a real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample. As a depth-map algorithm it can handle arbitrary shadowed sur...
110
click to vote
MICS
2010
15 years 21 days ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
123
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
111
click to vote
PODS
2012
ACM
13 years 4 months ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...