Sciweavers

9209 search results - page 230 / 1842
» Data Space Randomization
Sort
View
SIAMIS
2010
378views more  SIAMIS 2010»
15 years 1 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
ECML
2007
Springer
16 years 15 days ago
Scale-Space Based Weak Regressors for Boosting
Boosting is a simple yet powerful modeling technique that is used in many machine learning and data mining related applications. In this paper, we propose a novel scale-space based...
Jin Hyeong Park, Chandan K. Reddy
IPPS
2006
IEEE
16 years 11 days ago
Exploring the design space of an optimized compiler approach for mesh-like coarse-grained reconfigurable architectures
In this paper we study the performance improvements and trade-offs derived from an optimized mapping approach applied on a parametric coarse grained reconfigurable array architect...
Grigoris Dimitroulakos, Michalis D. Galanis, Const...
NN
2010
Springer
183views Neural Networks» more  NN 2010»
15 years 4 months ago
Dimensionality reduction for density ratio estimation in high-dimensional spaces
The ratio of two probability density functions is becoming a quantity of interest these days in the machine learning and data mining communities since it can be used for various d...
Masashi Sugiyama, Motoaki Kawanabe, Pui Ling Chui
194
Voted
SIBGRAPI
2008
IEEE
16 years 22 days ago
Approximations by Smooth Transitions in Binary Space Partitions
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
Marcos Lage, Alex Laier Bordignon, Fabiano Petrone...