Sciweavers

1418 search results - page 273 / 284
» Schema polynomials and applications
Sort
View
TAMC
2010
Springer
14 years 1 months ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 1 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
HYBRID
2001
Springer
14 years 27 days ago
Accurate Event Detection for Simulating Hybrid Systems
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
Joel M. Esposito, Vijay Kumar, George J. Pappas
SSD
2001
Springer
120views Database» more  SSD 2001»
14 years 25 days ago
On Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra