5606 search results - page 411 / 1122 » Randomization Techniques for Graphs. |
178
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
153
click to vote
ESANN
2003
15 years 8 months ago
2003
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
188
click to vote
ECEASST
2008
15 years 6 months ago
2008
Abstract: Templates are a language feature of C++ and can be used for metaprogramming. The metaprogram is executed by the compiler and outputs source code which is then compiled. T...
143
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
198
Voted
JDA
2006
15 years 6 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...