Sciweavers

680 search results - page 13 / 136
» Intrinsically Motivated Machines
Sort
View
TIT
1998
79views more  TIT 1998»
13 years 7 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Accelerating HMMER on GPUs by implementing hybrid data and task parallelism
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 8 months ago
Learning Isometric Separation Maps
Maximum Variance Unfolding (MVU) and its variants have been very successful in embedding data-manifolds in lower dimensionality spaces, often revealing the true intrinsic dimensio...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
PAAMS
2010
Springer
13 years 5 months ago
Variable Length-Based Genetic Representation to Automatically Evolve Wrappers
The Web has been the star service on the Internet, however the outsized information available and its decentralized nature has originated an intrinsic difficulty to locate, extract...
David F. Barrero, Antonio González-Pardo, M...
ERLANG
2003
ACM
14 years 1 months ago
Automated test generation for industrial Erlang applications
We present an implemented technique for generating test cases from state machine specifications. The work is motivated by a need for testing of protocols and services developed b...
Johan Blom, Bengt Jonsson