Sciweavers

2223 search results - page 167 / 445
» Ontological Framework for Approximation
Sort
View
FOIKS
2008
Springer
15 years 7 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
IS
2006
15 years 6 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
LPNMR
2005
Springer
15 years 11 months ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker
RSCTC
2004
Springer
110views Fuzzy Logic» more  RSCTC 2004»
15 years 11 months ago
A Graded Applicability of Rules
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
Anna Gomolinska