Sciweavers

9842 search results - page 1709 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SI3D
2006
ACM
15 years 10 months ago
View-dependent precomputed light transport using nonlinear Gaussian function approximations
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...
Paul Green, Jan Kautz, Wojciech Matusik, Fré...
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
VISUALIZATION
2005
IEEE
15 years 10 months ago
Illustration and Photography Inspired Visualization of Flows and Volumes
Understanding and analyzing complex volumetrically varying data is a difficult problem. Many computational visualization techniques have had only limited success in succinctly po...
Nikolai A. Svakhine, Yun Jang, David S. Ebert, Kel...
KCAP
2005
ACM
15 years 10 months ago
Semantic Association of Taxonomy-based Standards Using Ontology
The vision of semantic interoperability, the fluid sharing of digitalized knowledge, has led much research on ontology/schema mapping/aligning. Although this line of research is f...
Hung-Ju Chu, Randy Y. C. Chow, Su-Shing Chen, Raja...
MOBICOM
2005
ACM
15 years 10 months ago
An analytical model for the dimensioning of a GPRS/EDGE network with a capacity constraint on a group of cells
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...
Georges Nogueira, Bruno Baynat, Pierre Eisenmann
« Prev « First page 1709 / 1969 Last » Next »