Sciweavers

7773 search results - page 1210 / 1555
» On generalized Frame-Stewart numbers
Sort
View
CIKM
2006
Springer
15 years 10 months ago
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
CP
2000
Springer
15 years 10 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
EKAW
2000
Springer
15 years 10 months ago
Torture Tests: A Quantitative Analysis for the Robustness of Knowledge-Based Systems
Abstract. The overall aim of this paper is to provide a general setting for quantitative quality measures of Knowledge-Based System behavior which is widely applicable to many Know...
Perry Groot, Frank van Harmelen, Annette ten Teije
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 10 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
« Prev « First page 1210 / 1555 Last » Next »