Sciweavers

780 search results - page 139 / 156
» Stability of fast algorithms for structured linear systems
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
CONCUR
1999
Springer
15 years 2 months ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
BIS
2010
159views Business» more  BIS 2010»
14 years 5 months ago
Comparing Intended and Real Usage in Web Portal: Temporal Logic and Data Mining
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only par...
Jérémy Besson, Ieva Mitasiunaite, Au...
SIAMSC
2011
148views more  SIAMSC 2011»
14 years 4 months ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 2 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross