Sciweavers

7106 search results - page 180 / 1422
» Restricted Complexity, General Complexity
Sort
View
120
Voted
JSC
2007
84views more  JSC 2007»
15 years 3 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
154
Voted
EMSOFT
2005
Springer
15 years 9 months ago
High-level real-time programming in Java
Real-time systems have reached a level of complexity beyond the scaling capability of the low-level or restricted languages traditionally used for real-time programming. While Met...
David F. Bacon, Perry Cheng, David Grove, Michael ...
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 4 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
124
Voted
STACS
1993
Springer
15 years 7 months ago
A First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
Eric Allender, José L. Balcázar, Nei...
121
Voted
AMW
2010
15 years 5 months ago
Minimising RDF Graphs under Rules and Constraints Revisited
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...