Sciweavers

381 search results - page 41 / 77
» Fast Neighbor Joining
Sort
View
AAAI
2012
13 years 6 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
DEXA
2007
Springer
135views Database» more  DEXA 2007»
15 years 10 months ago
Semantic Grouping of Social Networks in P2P Database Settings
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...
Verena Kantere, Dimitrios Tsoumakos, Timos K. Sell...
BTW
2007
Springer
133views Database» more  BTW 2007»
15 years 8 months ago
Pathfinder: XQuery Compila-tion Techniques for Relational Database Targets
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
Jens Teubner
IS
2008
15 years 4 months ago
A framework for semantic grouping in P2P databases
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...
Verena Kantere, Dimitrios Tsoumakos, Timos K. Sell...
NETWORK
2010
148views more  NETWORK 2010»
14 years 11 months ago
DOM: a scalable multicast protocol for next-generation internet
In this article we propose a scalable and efficient destination-oriented multicast protocol for next-generation Internet. With DOM, each packet carries explicit destinations infor...
Xiaohua Tian, Yu Cheng, Xuemin Shen