Sciweavers

2754 search results - page 208 / 551
» Distributed Weighted Matching
Sort
View
SUM
2007
Springer
15 years 9 months ago
Managing Uncertainty in Schema Matcher Ensembles
Schema matching is the task of matching between concepts describing the meaning of data in various heterogeneous, distributed data sources. With many heuristics to choose from, sev...
Anan Marie, Avigdor Gal
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 3 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
DATE
2009
IEEE
102views Hardware» more  DATE 2009»
15 years 9 months ago
Register placement for high-performance circuits
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
Mei-Fang Chiang, Takumi Okamoto, Takeshi Yoshimura
SAC
2008
ACM
15 years 2 months ago
Adaptive methods for sequential importance sampling with application to state space models
Abstract. In this paper we discuss new adaptive proposal strategies for sequential Monte Carlo algorithms--also known as particle filters--relying on new criteria evaluating the qu...
Julien Cornebise, Eric Moulines, Jimmy Olsson
ICML
2008
IEEE
16 years 3 months ago
Efficiently learning linear-linear exponential family predictive representations of state
Exponential Family PSR (EFPSR) models capture stochastic dynamical systems by representing state as the parameters of an exponential family distribution over a shortterm window of...
David Wingate, Satinder P. Singh