Sciweavers

1021 search results - page 7 / 205
» Fast Approximate PCPs
Sort
View
EC
2011
240views ECommerce» more  EC 2011»
13 years 2 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
VLSISP
2010
205views more  VLSISP 2010»
13 years 6 months ago
Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
TOG
2010
157views more  TOG 2010»
13 years 2 months ago
Combining global and local virtual lights for detailed glossy illumination
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...
Tomás Davidovic, Jaroslav Krivánek, ...
INFOCOM
2012
IEEE
11 years 10 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...