Sciweavers

310 search results - page 61 / 62
» High-Dimensional Similarity Joins
Sort
View
ISBRA
2009
Springer
14 years 1 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
DMSN
2009
ACM
14 years 26 days ago
FSort: external sorting on flash-based sensor devices
In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when ...
Panayiotis Andreou, Orestis Spanos, Demetrios Zein...
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
13 years 11 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 10 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
AAMAS
2008
Springer
13 years 6 months ago
DARE: a system for distributed abductive reasoning
Abductive reasoning is a well established field of Artificial Intelligence widely applied to different problem domains not least cognitive robotics and planning. It has been used ...
Jiefei Ma, Alessandra Russo, Krysia Broda, Keith C...