Sciweavers

708 search results - page 35 / 142
» Timing closure: the solution and its problems
Sort
View
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 2 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
UAI
1990
14 years 11 months ago
Ideal reformulation of belief networks
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
Jack S. Breese, Eric Horvitz
CVPR
2008
IEEE
15 years 12 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
DAGM
2010
Springer
14 years 11 months ago
Uncertainty Driven Multi-scale Optimization
This paper proposes a new multi-scale energy minimization algorithm which can be used to efficiently solve large scale labelling problems in computer vision. The basic modus operan...
Pushmeet Kohli, Victor S. Lempitsky, Carsten Rothe...
ATMOS
2007
161views Optimization» more  ATMOS 2007»
14 years 11 months ago
Periodic Railway Timetabling with Event Flexibility
This paper addresses the problem of generating conflict-free periodic train timetables for large railway networks. We follow a two level approach, where a simplified track topolo...
Gabrio Curzio Caimi, Martin Fuchsberger, Marco Lau...