Sciweavers

77 search results - page 5 / 16
» On Array Theory of Bounded Elements
Sort
View
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
14 years 8 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
13 years 8 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
AAAI
2008
13 years 9 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
CAD
2007
Springer
13 years 7 months ago
A formal theory for estimating defeaturing-induced engineering analysis errors
Defeaturing is a popular CAD/ CAE simplification technique where ‘small or irrelevant features’ are suppressed within a CAD model for speeding-up downstream processes, especia...
Sankara Hari Gopalakrishnan, Krishnan Suresh
TSP
2010
13 years 2 months ago
Rate distortion bounds on passive sonar performance
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
Tianzhu Meng, John R. Buck