Sciweavers

537 search results - page 59 / 108
» Complete Performance Graphs in Probabilistic Information Ret...
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
14 years 8 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
NN
2011
Springer
348views Neural Networks» more  NN 2011»
13 years 2 months ago
Tree-like hierarchical associative memory structures
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
João Sacramento, Andreas Wichert
GIS
2007
ACM
14 years 8 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
APSEC
2003
IEEE
14 years 1 months ago
Understanding How the Requirements Are Implemented in Source Code
For software maintenance and evolution, a common problem is to understand how each requirement is implemented in the source code. The basic solution of this problem is to find the...
Wei Zhao, Lu Zhang, Yin Liu, Jing Luo, Jiasu Sun