Sciweavers

1209 search results - page 38 / 242
» Universal Algebra and Computer Science
Sort
View

Source Code
1729views
14 years 5 months ago
QVision: Qt's Image, Video and Computer Vision Library
Built upon the Qt library, the QVision is an image processing and computer vision library. It offers a set of image processing and matrix, vector and tensor algebra functions, unde...
P. E. López-de-Teruel, A. Rodríguez.
CSR
2008
Springer
13 years 10 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 9 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
CSR
2009
Springer
13 years 9 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
STACS
2001
Springer
14 years 1 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel