Sciweavers

2468 search results - page 99 / 494
» A New Approach to Pseudoword Generation
Sort
View
CATS
2008
15 years 7 months ago
Modelling for Lazy Clause Generation
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
Olga Ohrimenko, Peter J. Stuckey
MIDDLEWARE
2010
Springer
15 years 4 months ago
Automatically Generating Symbolic Prefetches for Distributed Transactional Memories
Abstract. Developing efficient distributed applications while managing complexity can be challenging. Managing network latency is a key challenge for distributed applications. We ...
Alokika Dash, Brian Demsky
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
14 years 10 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
CEC
2009
IEEE
16 years 1 months ago
Dynamic search initialisation strategies for multi-objective optimisation in peer-to-peer networks
Abstract— Peer-to-peer based distributed computing environments can be expected to be dynamic to greater of lesser degree. While node losses will not usually lead to catastrophic...
Ian Scriven, Andrew Lewis, Sanaz Mostaghim
ILP
2005
Springer
15 years 12 months ago
A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment
We propose a new approach to Inductive Logic Programming that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computati...
Héctor Corrada Bravo, David Page, Raghu Ram...