Sciweavers

1801 search results - page 58 / 361
» Pointing without a pointer
Sort
View
PAMI
1998
84views more  PAMI 1998»
13 years 8 months ago
Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps
A new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is to rst extract a low-d...
Jörg Bruske, Gerald Sommer
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 6 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
CGO
2007
IEEE
14 years 3 months ago
Code Compaction of an Operating System Kernel
General-purpose operating systems, such as Linux, are increasingly being used in embedded systems. Computational resources are usually limited, and embedded processors often have ...
Haifeng He, John Trimble, Somu Perianayagam, Saumy...
P2P
2007
IEEE
14 years 3 months ago
PEPINO: PEer-to-Peer network INspectOr
PEPINO is a simple and effective peer-to-peer network inspector. It visualises not only meaningful pointers and connections between peers, but also the exchange of messages betwee...
Donatien Grolaux, Boris Mejías, Peter Van R...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 3 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto