Sciweavers

3454 search results - page 470 / 691
» Modern computer algebra
Sort
View
APAL
2002
73views more  APAL 2002»
15 years 5 months ago
The sequentially realizable functionals
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
John Longley
JCB
1998
105views more  JCB 1998»
15 years 5 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
SQJ
2002
106views more  SQJ 2002»
15 years 5 months ago
Energy Metric for Software Systems
Acknowledging the intense requirement for low power operation in most portable computing systems, this paper introduces the notion of energy efficient software design and proposes ...
Alexander Chatzigeorgiou, George Stephanides
PVLDB
2008
123views more  PVLDB 2008»
15 years 5 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
JACM
2010
116views more  JACM 2010»
15 years 4 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára