2450 search results - page 331 / 490 » Time Mapping with Hypergraphs |
138
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
We had introduced the massively parallel global cellular automata (GCA) model. Parallel algorithms derived from applications can be mapped straight forward onto this model. In thi...
124
Voted
ECCC
2006
15 years 3 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
132
click to vote
GEOINFORMATICA
1998
15 years 3 months ago
1998
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...
149
Voted
NN
1998
Springer
15 years 3 months ago
1998
Springer
The selection and control of action is a critical problem for both biological and machine animated systems that must operate in complex real world situations. Visually guided eye ...
192
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...