4074 search results - page 76 / 815 » Defining Computational Aesthetics |
GIS
2008
ACM
14 years 8 months ago
2008
ACM
Isochrones are defined as the set of all points from which a specific point of interest is reachable within a given time span. This demo paper presents a solution to compute isoch...
ANTS
2008
Springer
13 years 9 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
ACL
2001
13 years 9 months ago
2001
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
CMG
2001
13 years 9 months ago
2001
- The KDD (Knowledge Discovery in Databases) paradigm is a step by step process for finding interesting patterns in large amounts of data. Data mining is one step in the process. T...
JAIR
2008
13 years 7 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...