Sciweavers

699 search results - page 9 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
COGSCI
2010
103views more  COGSCI 2010»
14 years 9 months ago
A Computational Account of the Development of the Generalization of Shape Information
Abecassis, Sera, Yonas, and Schwade (2001) have shown that young children represent shapes more metrically, and perhaps more holistically, than do older children and adults. How d...
Leonidas A. A. Doumas, John E. Hummel
SIAMDM
2010
149views more  SIAMDM 2010»
14 years 8 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
QEST
2006
IEEE
15 years 3 months ago
Compositional Quantitative Reasoning
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...
Krishnendu Chatterjee, Luca de Alfaro, Marco Faell...
BMCBI
2007
157views more  BMCBI 2007»
14 years 9 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...
LOGCOM
2007
92views more  LOGCOM 2007»
14 years 9 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley