Sciweavers

255 search results - page 1 / 51
» Approximate Tree Embedding Problem - An Algebraic Approach
Sort
View
TDM
2004
132views Database» more  TDM 2004»
13 years 6 months ago
Approximate Tree Embedding Problem - An Algebraic Approach
Václav Snásel, Emilie Septakova, Igo...
AI
2008
Springer
13 years 5 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
SPAA
2004
ACM
13 years 10 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CADE
2004
Springer
14 years 5 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
SCAM
2007
IEEE
13 years 11 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...