Sciweavers

697 search results - page 48 / 140
» Approximation of Information Granule Sets
Sort
View
CGF
2008
137views more  CGF 2008»
15 years 25 days ago
Real-Time Indirect Illumination and Soft Shadows in Dynamic Scenes Using Spherical Lights
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
P. Guerrero, Stefan Jeschke, Michael Wimmer
91
Voted
ECCC
2008
108views more  ECCC 2008»
15 years 24 days ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
TPDS
2008
136views more  TPDS 2008»
15 years 19 days ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
107
Voted
MP
1998
109views more  MP 1998»
15 years 12 days ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
SPIRE
2009
Springer
15 years 7 months ago
A Last-Resort Semantic Cache for Web Queries
We propose a method to evaluate queries using a last-resort semantic cache in a distributed Web search engine. The cache stores a group of frequent queries and for each of these qu...
Flavio Ferrarotti, Mauricio Marín, Marcelo ...