Sciweavers

900 search results - page 58 / 180
» Metric Structures and Probabilistic Computation
Sort
View
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
GI
2009
Springer
14 years 11 days ago
Deriving Taxonomies from Automatic Analysis of Group Membership Structure in Large Social Networks
: We develop a method to create taxonomies in large social networks solely based on users group membership information. We illustrate our technique using an example of the Flickr p...
Marc Egger, Kai Fischbach, Peter A. Gloor, Andre L...
QEST
2007
IEEE
14 years 2 months ago
A Performance Analysis Tool for Scenario-Aware Streaming Applications
Dataflow models are often used for analysing streaming applications. The recently introduced scenario-aware extension of the synchronous dataflow model can capture the dynamism ...
Bart D. Theelen
LAWEB
2003
IEEE
14 years 1 months ago
The Best Trail Algorithm for Assisted Navigation of Web Sites
We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus....
Richard Wheeldon, Mark Levene
ICALP
1992
Springer
13 years 12 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao