3265 search results - page 306 / 653 » Representing Groups on Graphs |
185
click to vote
CC
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
177
click to vote
WADS
2005
Springer
16 years 6 days ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
140
click to vote
DEXA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we investigate various aspects of representing multidimensional information in the frame of the WWW. Multidimensional XML (MXML) is an extension of XML suitable for r...
154
click to vote
APCHI
1998
IEEE
15 years 11 months ago
1998
IEEE
Direct manipulation interfaces are characterised according to the representation of the task domain: the domain objects and the effect of user operations on those objects. In the ...
181
click to vote
CLOUDCOM
2009
Springer
15 years 10 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...