1439 search results - page 236 / 288 » Fast approximation of centrality |
121
click to vote
ANNPR
2008
Springer
15 years 2 months ago
2008
Springer
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
109
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
111
click to vote
ARITH
2005
IEEE
15 years 2 months ago
2005
IEEE
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
133
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
149
click to vote
CVPR
2005
IEEE
15 years 2 months ago
2005
IEEE
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...