Sciweavers

1802 search results - page 34 / 361
» Complexity Theory for Operators in Analysis
Sort
View
ISSAC
2007
Springer
142views Mathematics» more  ISSAC 2007»
15 years 11 months ago
Fast arithmetic for triangular sets: from theory to practice
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
Xin Li, Marc Moreno Maza, Éric Schost
JACM
2000
119views more  JACM 2000»
15 years 4 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
ICDE
1999
IEEE
109views Database» more  ICDE 1999»
16 years 6 months ago
On the Semantics of Complex Events in Active Database Management Systems
Active database management systems have been developed for applications needing an automatic reaction in response to certain events. Events can be simple in nature or complex. Com...
Detlef Zimmer, Rainer Unland
GI
2003
Springer
15 years 10 months ago
An Integrated Approach to Survivability Analysis of Large Complex Critical Infrastructures
: The integrated approach for analysis of Large Complex Critical Infrastructures (LCCIs) to afford survivability aimed at preparing a Roadmap for Research and Development for criti...
Sandro Bologna, Thomas Beer
158
Voted
CMSB
2008
Springer
15 years 6 months ago
Automatic Complexity Analysis and Model Reduction of Nonlinear Biochemical Systems
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...
Dirk Lebiedz, Dominik Skanda, Marc Fein