Sciweavers

14 search results - page 2 / 3
» Self-organizing maps of symbol strings
Sort
View
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
13 years 11 months ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
BMCBI
2007
152views more  BMCBI 2007»
13 years 5 months ago
Difference-based clustering of short time-course microarray data with replicates
Background: There are some limitations associated with conventional clustering methods for short time-course gene expression data. The current algorithms require prior domain know...
Jihoon Kim, Ju Han Kim
BMCBI
2008
214views more  BMCBI 2008»
13 years 5 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 4 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
PASTE
2005
ACM
13 years 10 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen