Sciweavers

1816 search results - page 356 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
SIGGRAPH
1993
ACM
15 years 1 months ago
Wavelet radiosity
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
Steven J. Gortler, Peter Schröder, Michael F....
COLT
2006
Springer
15 years 1 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
CVPR
2010
IEEE
15 years 27 days ago
Classification and Clustering via Dictionary Learning with Structured Incoherence
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapir...
AAAI
2010
14 years 11 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
SIMVIS
2007
14 years 11 months ago
Chances and Limits of Progression in Visualization
The amount of data to be represented by visualization systems requires new ideas for data processing and representation. As proposed in this contribution, this might be solved by ...
René Rosenbaum, Heidrun Schumann