393 search results - page 56 / 79 » Defining Models - Meta Models versus Graph Grammars |
101
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
180
click to vote
NLP
2000
15 years 1 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
65
Voted
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
ASPDAC
1998
ACM
15 years 1 months ago
1998
ACM
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
DEXAW
2004
IEEE
15 years 1 months ago
2004
IEEE
The Web is moving to a new generation in which machine-understandable processing is mandatory. In order to achieve this goal it is essential to define ontologies which enable the ...