Sciweavers

318 search results - page 6 / 64
» Real Number Computability and Domain Theory
Sort
View
VLDB
2007
ACM
129views Database» more  VLDB 2007»
14 years 7 months ago
Efficient Skyline Computation over Low-Cardinality Domains
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them...
Michael D. Morse, Jignesh M. Patel, H. V. Jagadish
CIE
2005
Springer
14 years 1 months ago
Computability in Computational Geometry
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
Abbas Edalat, Ali Asghar Khanban, André Lie...
ACSAC
2003
IEEE
14 years 26 days ago
Practical Random Number Generation in Software
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
John Viega
CSR
2007
Springer
13 years 11 months ago
On Empirical Meaning of Randomness with Respect to a Real Parameter
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
Vladimir V. V'yugin
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 12 days 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