Sciweavers

1199 search results - page 240 / 240
» Robust inference of trees
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
SCN
2011
Springer
348views Communications» more  SCN 2011»
14 years 4 months ago
MANET QoS support without reservations
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...
Soon-Young Oh, Gustavo Marfia, Mario Gerla
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 9 days 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...
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 3 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...