Sciweavers

1424 search results - page 108 / 285
» The Multi-radius Cover Problem
Sort
View
123
Voted
CGI
2004
IEEE
15 years 7 months ago
Fast Environmental Lighting for Local-PCA Encoded BTFs
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
Gero Müller, Jan Meseth, Reinhard Klein
IPM
2006
83views more  IPM 2006»
15 years 3 months ago
A risk minimization framework for information retrieval
This paper presents a probabilistic information retrieval framework in which the retrieval problem is formally treated as a statistical decision problem. In this framework, querie...
ChengXiang Zhai, John D. Lafferty

Lecture Notes
2225views
17 years 1 months ago
Microeconomics
The main objective of the course is for students to be able to analyze problems in microeconomic theory at the beginning graduate level. Students successfully completing the course...
Arne Hallam
LATIN
2010
Springer
15 years 10 months ago
Colorful Strips
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
15 years 8 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...