Sciweavers

7015 search results - page 1333 / 1403
» Approximation algorithms for co-clustering
Sort
View
COMPGEOM
2007
ACM
14 years 1 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
COMSWARE
2007
IEEE
14 years 1 months ago
Efficient Design of End-to-End Probes for Source-Routed Networks
Migration to a converged network has caused service providers to deploy real time applications such as voice over an IP (VoIP) network. From the provider's perspective, the s...
Srinivasan Parthasarathya, Rajeev Rastogi, Marina ...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
DSN
2007
IEEE
14 years 1 months ago
Bounding Peer-to-Peer Upload Traffic in Client Networks
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...
Chun-Ying Huang, Chin-Laung Lei
EDBT
2009
ACM
134views Database» more  EDBT 2009»
14 years 1 months ago
Caching content-based queries for robust and efficient image retrieval
In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency iss...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
« Prev « First page 1333 / 1403 Last » Next »