4378 search results - page 324 / 876 » On the Complexity of Ordered Colourings |
209
click to vote
PRIS
2004
15 years 8 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
155
click to vote
UAI
2001
15 years 8 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
169
click to vote
VG
2003
15 years 8 months ago
2003
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming t...
156
click to vote
ISMB
1997
15 years 8 months ago
1997
Molecular biology has a communicationproblem. There are manydatabases using their ownlabels and categories for storing data objects and someusing identical labels andcategories bu...
178
click to vote
SLP
1994
15 years 8 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...