Sciweavers

2477 search results - page 88 / 496
» Approximate extended formulations
Sort
View
ADC
2006
Springer
120views Database» more  ADC 2006»
15 years 10 months ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
15 years 9 months ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...
RANDOM
1999
Springer
15 years 8 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav
AI
2008
Springer
15 years 4 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
118
Voted
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 4 months ago
Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case
Abstract-- Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor net...
Zichong Chen, Guillermo Barrenetxea, Martin Vetter...