Sciweavers

2254 search results - page 418 / 451
» Computing the minimal covering set
Sort
View
ICCV
2005
IEEE
14 years 3 months ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 3 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
FCCM
2000
IEEE
162views VLSI» more  FCCM 2000»
14 years 2 months ago
StReAm: Object-Oriented Programming of Stream Architectures Using PAM-Blox
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
Oskar Mencer, Heiko Hübert, Martin Morf, Mich...
SIGGRAPH
1993
ACM
14 years 2 months ago
Radioptimization: goal based rendering
This paper presents a method for designing the illumination in an environment using optimization techniques applied to a radiosity based image synthesis system. An optimization of...
John K. Kawai, James S. Painter, Michael F. Cohen