Sciweavers

1532 search results - page 276 / 307
» The Symbol Grounding Problem
Sort
View
245
Voted
POPL
2008
ACM
16 years 4 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
146
Voted
CADE
2009
Springer
15 years 10 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 10 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
142
Voted
HRI
2006
ACM
15 years 9 months ago
FOCUS: a generalized method for object discovery for robots that observe and interact with humans
The essence of the signal-to-symbol problem consists of associating a symbolic description of an object (e.g., a chair) to a signal (e.g., an image) that captures the real object....
Manuela M. Veloso, Paul E. Rybski, Felix von Hunde...
185
Voted
KELSI
2004
Springer
15 years 9 months ago
Improving Rule Induction Precision for Automated Annotation by Balancing Skewed Data Sets
There is an overwhelming increase in submissions to genomic databases, posing a problem for database maintenance, especially regarding annotation of fields left blank during submi...
Gustavo E. A. P. A. Batista, Maria Carolina Monard...