1632 search results - page 259 / 327 » Sublinear Time Algorithms for Metric Space Problems |
126
Voted
ETS
2006
IEEE
15 years 9 months ago
2006
IEEE
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
121
Voted
SAC
2006
ACM
15 years 9 months ago
2006
ACM
Abstract. In this paper we propose a new method to perform incremental discretization. The basic idea is to perform the task in two layers. The first layer receives the sequence o...
126
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
110
click to vote
KES
1998
Springer
15 years 7 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
116
Voted
RT
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...