1458 search results - page 155 / 292 » Monads for incremental computing |
136
click to vote
ACMSE
2006
ACM
16 years 12 days ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
139
click to vote
CCGRID
2005
IEEE
16 years 2 days ago
2005
IEEE
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multip...
178
click to vote
ACIVS
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we present an interactive, object-based video retrieval system which features a novel query formulation method that is used to iteratively refine an underlying model...
185
click to vote
DCOSS
2005
Springer
15 years 12 months ago
2005
Springer
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through ...
160
click to vote
EGC
2005
Springer
15 years 12 months ago
2005
Springer
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...