Sciweavers

5592 search results - page 284 / 1119
» On Random Betweenness Constraints
Sort
View
STOC
2001
ACM
97views Algorithms» more  STOC 2001»
16 years 6 months ago
Sharp threshold and scaling window for the integer partitioning problem
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
Christian Borgs, Jennifer T. Chayes, Boris Pittel
DEXA
2009
Springer
177views Database» more  DEXA 2009»
16 years 1 months ago
A Versatile Record Linkage Method by Term Matching Model Using CRF
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...
Quang Minh Vu, Atsuhiro Takasu, Jun Adachi
CISS
2008
IEEE
16 years 1 months ago
Distributed estimation in wireless sensor networks via variational message passing
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
Yanbing Zhang, Huaiyu Dai
ICASSP
2008
IEEE
16 years 1 months ago
Belief propagation distributed estimation in sensor networks: An optimized energy accuracy tradeoff
The estimation error performance of Gaussian belief propagation based distributed estimation in a large sensor network employing random sleep strategies is explicitly evaluated fo...
John MacLaren Walsh, Phillip A. Regalia
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
16 years 20 days ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia