Sciweavers

963 search results - page 111 / 193
» On the decomposition of rational functions
Sort
View
SIGGRAPH
1991
ACM
14 years 12 days ago
A global illumination solution for general reflectance distributions
A general light transfer simulation algorithm for environments composed of materials with arbitrary reflectance functions is presented. This algorithm removes the previous practic...
François X. Sillion, James Arvo, Stephen H....
NIPS
2007
13 years 10 months ago
DIFFRAC: a discriminative and flexible framework for clustering
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
Francis Bach, Zaïd Harchaoui
NIPS
2001
13 years 10 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
JUCS
2010
143views more  JUCS 2010»
13 years 7 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
POPL
2009
ACM
14 years 9 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux