Sciweavers

1332 search results - page 162 / 267
» Combinatorial Algorithms
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
SWARM: A Parallel Programming Framework for Multicore Processors
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
David A. Bader, Varun Kanade, Kamesh Madduri
CVPR
2005
IEEE
14 years 11 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
AAECC
2006
Springer
79views Algorithms» more  AAECC 2006»
14 years 3 months ago
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
Moshe Schwartz, Alexander Vardy
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
14 years 3 months ago
Some Basics on Tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
Boris Goldengorin, Gerold Jäger, Paul Molitor
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
14 years 2 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley