Sciweavers

7430 search results - page 1093 / 1486
» Programming Applications in CIFF
Sort
View
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 10 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
RTA
2010
Springer
15 years 10 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
CVPR
2009
IEEE
15 years 10 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
Roman Sandler, Michael Lindenbaum
HOTOS
2007
IEEE
15 years 10 months ago
Relaxed Determinism: Making Redundant Execution on Multiprocessors Practical
Given that the majority of future processors will contain an abundance of execution cores, redundant execution can offer a promising method for increasing the availability and res...
Jesse Pool, Ian Sin Kwok Wong, David Lie
ICASSP
2007
IEEE
15 years 10 months ago
Depth Detection of Light Field
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...
Yi-Hao Kao, Chia-Kai Liang, Li-Wen Chang, Homer H....
« Prev « First page 1093 / 1486 Last » Next »