Results 1  10
of
1,832,138
A QuasiMonte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting
 MONTECARLO AND QUASIMONTE CARLO METHODS IN SCIENTIFIC COMPUTING
, 1995
"... One of the main problems in computer graphics is to solve the global illumination problem, which is given by a Fredholm integral equation of the second kind, called the radiance equation (REQ). In order to achieve realistic images, a very complex kernel of the integral equation, modelling all phys ..."
Abstract

Cited by 38 (5 self)
 Add to MetaCart
One of the main problems in computer graphics is to solve the global illumination problem, which is given by a Fredholm integral equation of the second kind, called the radiance equation (REQ). In order to achieve realistic images, a very complex kernel of the integral equation, modelling all
An Importance Driven MonteCarlo Solution to the Global Illumination Problem
, 1994
"... : We propose a method for solving the global illumination problem with no restrictive assumptions concerning the behaviour of light either on surface or volume objects in the scene. Surface objects are defined either by facets or parametric patches and volume objets are defined by voxel grids which ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
: We propose a method for solving the global illumination problem with no restrictive assumptions concerning the behaviour of light either on surface or volume objects in the scene. Surface objects are defined either by facets or parametric patches and volume objets are defined by voxel grids which
QuasiMonte Carlo Methods in Computer Graphics: The Global Illumination Problem
 Proc. of the SIAM Conference in Park City
, 1995
"... The main part of the global illumination problem of computer graphics is given by a Fredholm integral equation of the second kind, describing the light distribution in a closed environment. Calculating photorealistic images from that equation requires its kernel to be very complex and discontinuo ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
The main part of the global illumination problem of computer graphics is given by a Fredholm integral equation of the second kind, describing the light distribution in a closed environment. Calculating photorealistic images from that equation requires its kernel to be very complex
Global Optimization with Polynomials and the Problem of Moments
 SIAM Journal on Optimization
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear mat ..."
Abstract

Cited by 569 (47 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Rendering Synthetic Objects into Real Scenes: Bridging Traditional and Imagebased Graphics with Global Illumination and High Dynamic Range Photography
, 1998
"... We present a method that uses measured scene radiance and global illumination in order to add new objects to lightbased models with correct lighting. The methodusesahighdynamicrangeimagebasedmodelofthescene, ratherthansyntheticlightsources,toilluminatethe new objects. Tocomputetheillumination,thesc ..."
Abstract

Cited by 436 (17 self)
 Add to MetaCart
We present a method that uses measured scene radiance and global illumination in order to add new objects to lightbased models with correct lighting. The methodusesahighdynamicrangeimagebasedmodelofthescene, ratherthansyntheticlightsources,toilluminatethe new objects. Tocomputetheillumination
Learning with local and global consistency
 Advances in Neural Information Processing Systems 16
, 2004
"... We consider the general problem of learning from labeled and unlabeled data, which is often called semisupervised learning or transductive inference. A principled approach to semisupervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic stru ..."
Abstract

Cited by 666 (21 self)
 Add to MetaCart
We consider the general problem of learning from labeled and unlabeled data, which is often called semisupervised learning or transductive inference. A principled approach to semisupervised learning is to design a classifying function which is sufficiently smooth with respect to the intrinsic
Distributed Snapshots: Determining Global States of Distributed Systems
 ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1985
"... This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to s ..."
Abstract

Cited by 1215 (6 self)
 Add to MetaCart
This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps
A Note on the Confinement Problem
, 1973
"... This not explores the problem of confining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified. ..."
Abstract

Cited by 532 (0 self)
 Add to MetaCart
This not explores the problem of confining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified.
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Results 1  10
of
1,832,138