Sciweavers

16626 search results - page 87 / 3326
» Computing is a natural science
Sort
View
WG
2004
Springer
15 years 7 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji
FOCS
2005
IEEE
15 years 7 months ago
On the Complexity of Real Functions
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
Mark Braverman
SYNTHESE
2008
110views more  SYNTHESE 2008»
15 years 1 months ago
Methodological naturalism and epistemic internalism
Epistemic naturalism holds that the results or methodologies from the cognitive sciences are relevant to epistemology, and some have maintained that scientific methods are more com...
Gregory R. Wheeler, Luís Moniz Pereira
ACL
2009
14 years 11 months ago
ProLiV - a Tool for Teaching by Viewing Computational Linguistics
ProLiV - Animated Process-modeler of Complex (Computational) Linguistic Methods and Theories - is a fully modular, flexible, XML-based stand-alone Java application, used for compu...
Monica Gavrila, Cristina Vertan
ICALP
2005
Springer
15 years 7 months ago
Basic Observables for a Calculus for Global Computing
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
Rocco De Nicola, Daniele Gorla, Rosario Pugliese