4074 search results - page 354 / 815 » Defining Computational Aesthetics |
173
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
170
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
We present a methodology and algorithms for automatic refinement from a given design specification to an architecture model based on decisions in architecture exploration. An arch...
168
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
178
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition r...
248
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...