5169 search results - page 155 / 1034 » Locality approximation using time |
202
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
127
click to vote
SBIA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
145
click to vote
ESANN
2003
15 years 6 months ago
2003
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
129
Voted
ENTCS
2008
15 years 5 months ago
2008
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
129
Voted
ICSE
2009
IEEE-ACM
15 years 11 months ago
2009
IEEE-ACM
Lightweight fault-localization techniques use program coverage to isolate the parts of the code that are most suspicious of being faulty. In this paper, we present the results of ...