Sciweavers

406 search results - page 12 / 82
» Recursive Approximability of Real Numbers
Sort
View
CIAC
2006
Springer
110views Algorithms» more  CIAC 2006»
13 years 11 months ago
Distance Approximating Trees: Complexity and Algorithms
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
Feodor F. Dragan, Chenyu Yan
JUCS
2002
90views more  JUCS 2002»
13 years 7 months ago
How Large is the Set of Disjunctive Sequences?
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
Ludwig Staiger
CIKM
2005
Springer
14 years 1 months ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
IGPL
2006
107views more  IGPL 2006»
13 years 7 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa
VLDB
2005
ACM
149views Database» more  VLDB 2005»
14 years 7 months ago
Selectivity estimators for multidimensional range queries over real attributes
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...
Dimitrios Gunopulos, George Kollios, Vassilis J. T...