Sciweavers

5105 search results - page 300 / 1021
» Approximate Structural Consistency
Sort
View
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 10 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
COMPGEOM
2005
ACM
15 years 8 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 8 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
UAI
2008
15 years 8 months ago
Learning and Solving Many-Player Games through a Cluster-Based Representation
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
Sevan G. Ficici, David C. Parkes, Avi Pfeffer
TOG
2008
163views more  TOG 2008»
15 years 6 months ago
Imperfect shadow maps for efficient computation of indirect illumination
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...