Sciweavers

32545 search results - page 617 / 6509
» Data Structures and Algorithms
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 10 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
STOC
2001
ACM
139views Algorithms» more  STOC 2001»
16 years 7 months ago
Approximate distance oracles
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
Mikkel Thorup, Uri Zwick
ISBI
2004
IEEE
16 years 8 months ago
Automatic Quantification of Microtubule Dynamics
The dynamics of the microtubule assembly are very significant both for cell function and structure. Abnormal function of the assembly is involved in neurodegenerative diseases and...
Stathis Hadjidemetriou, James S. Duncan, Derek Too...
CADE
2003
Springer
16 years 7 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 11 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher