Sciweavers

664 search results - page 103 / 133
» Some results for a class of generalized polynomials
Sort
View
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
15 years 1 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
GD
2005
Springer
15 years 3 months ago
Drawing Graphs Using Modular Decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
Charis Papadopoulos, Constantinos Voglis
RANDOM
1999
Springer
15 years 2 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav
CSUR
1998
99views more  CSUR 1998»
14 years 9 months ago
Multidimensional Access Methods
Search operations in databases require some special support at the physical level. This is true for conventional databases as well as for spatial databases, where typical search o...
Volker Gaede, Oliver Günther
CDC
2008
IEEE
152views Control Systems» more  CDC 2008»
15 years 4 months ago
Non-uniform small-gain theorems for systems with unstable invariant sets
— We consider the problem of small-gain analysis of asymptotic behavior in interconnected nonlinear dynamic systems. Mathematical models of these systems are allowed to be uncert...
Ivan Tyukin, Erik Steur, Henk Nijmeijer, Cees van ...