Sciweavers

398 search results - page 27 / 80
» A new biclustering technique based on crossing minimization
Sort
View
CGF
2008
153views more  CGF 2008»
15 years 14 days ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
ICIP
2009
IEEE
16 years 1 months ago
A Graph-cut Based Algorithm For Approximate Mrf Optimization
This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques...
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
15 years 4 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
106
Voted
SI3D
2012
ACM
13 years 8 months ago
Surface based anti-aliasing
We present surface based anti-aliasing (SBAA), a new approach to real-time anti-aliasing for deferred renderers that improves the performance and lowers the memory requirements fo...
Marco Salvi, Kiril Vidimce
ICASSP
2010
IEEE
15 years 17 days ago
Empirical quantization for sparse sampling systems
We propose a quantization design technique (estimator) suitable for new compressed sensing sampling systems whose ultimate goal is classification or detection. The design is base...
Michael A. Lexa