Sciweavers

199 search results - page 14 / 40
» Computationally and Algebraically Complex Finite Algebra Mem...
Sort
View
ISQED
2007
IEEE
254views Hardware» more  ISQED 2007»
14 years 2 months ago
An Aggregation-Based Algebraic Multigrid Method for Power Grid Analysis
ct This paper develops an aggregation-based algebraic multigrid (AbAMG) method to efficiently analyze the power grids. Different from the conventional algebraic multigrid (AMG) sc...
Pei-Yu Huang, Huan-Yu Chou, Yu-Min Lee
ECCC
2008
168views more  ECCC 2008»
13 years 8 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson
CGF
2008
227views more  CGF 2008»
13 years 8 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
ARTS
1999
Springer
14 years 27 days ago
Specifying Performance Measures for PEPA
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
Graham Clark, Stephen Gilmore, Jane Hillston
ENTCS
2008
103views more  ENTCS 2008»
13 years 8 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya