Sciweavers

15073 search results - page 93 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
120
Voted
FOCS
2004
IEEE
15 years 7 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
ICCV
2007
IEEE
16 years 5 months ago
A Robust Algorithm for Fiber-Bundle Atlas Construction
In this paper, we demonstrate an integrated registration and clustering algorithm to compute an atlas of fiberbundles from a set of multi-subject diffusion weighted MR images. We ...
Ulas Ziyan, Mert R. Sabuncu, W. Eric L. Grimson, C...
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
15 years 8 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
CONCURRENCY
2000
70views more  CONCURRENCY 2000»
15 years 3 months ago
Javelin++: scalability issues in global computing
Javelin is a Java-based infrastructure for global computing. This paper presents Javelin++, an extension of Javelin, intended to support a much larger set of computational hosts. ...
Michael O. Neary, Sean P. Brydon, Paul Kmiec, Sami...
SIGMOD
2005
ACM
146views Database» more  SIGMOD 2005»
16 years 3 months ago
Predicate Result Range Caching for Continuous Queries
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
Matthew Denny, Michael J. Franklin