1296 search results - page 183 / 260 » Searching with context |
DAWAK
2010
Springer
14 years 11 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper we study the computation error tolerance properties of motion estimation algorithms. We are motivated by two scenarios where hardware systems may introduce computati...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
ESWS
2007
Springer
15 years 1 months ago
2007
Springer
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...