Sciweavers

1532 search results - page 249 / 307
» The Symbol Grounding Problem
Sort
View
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 6 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
15 years 6 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
PERVASIVE
2007
Springer
15 years 6 months ago
Ambient Interfaces that Motivate Changes in Human Behavior
Peripheral or ambient displays move information from the periphery to the center of human attention and back. Our research group is interested in the interaction and interface des...
Jodi Forlizzi, Ian Li, Anind K. Dey
WABI
2007
Springer
15 years 6 months ago
Predicting Protein Folding Kinetics Via Temporal Logic Model Checking
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Christopher James Langmead, Sumit Kumar Jha
IPPS
2006
IEEE
15 years 5 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...