146 search results - page 20 / 30 » Mining complex models from arbitrarily large databases in co... |
STACS
2007
Springer
15 years 5 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
119
click to vote
IWCIA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
173
click to vote
GIS
2006
ACM
16 years 21 days ago
2006
ACM
Creating complex spatio?temporal simulation models is a hot issue in the area of spatio?temporal databases [7]. While existing Moving Object Simulators (MOSs) address different ph...
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
Finding patterns in large, real, spatio/temporal data continues to attract high interest (e.g., sales of products over space and time, patterns in mobile phone users; sensor netwo...
CIARP
2009
Springer
15 years 3 months ago
2009
Springer
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...