Sciweavers

3394 search results - page 314 / 679
» A Modal Model of Memory
Sort
View
176
Voted
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
15 years 11 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
USENIX
2000
15 years 8 months ago
Techniques for the Design of Java Operating Systems
Language-basedextensible systems, such as Java Virtual Machines and SPIN, use type safety to provide memory safety in a single address space. By using software to provide safety, ...
Godmar Back, Patrick Tullmann, Leigh Stoller, Wils...
CG
2007
Springer
15 years 6 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
TNN
2011
129views more  TNN 2011»
15 years 1 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
CAV
2004
Springer
136views Hardware» more  CAV 2004»
15 years 10 months ago
JNuke: Efficient Dynamic Analysis for Java
JNuke is a framework for verification and model checking of Java programs. It is a novel combination of run-time verification, explicit-state model checking, and counter-example ex...
Cyrille Artho, Viktor Schuppan, Armin Biere, Pasca...