Sciweavers

2229 search results - page 342 / 446
» The Case for Grounding Databases
Sort
View
ICDT
2010
ACM
137views Database» more  ICDT 2010»
15 years 4 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 10 days 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
204
Voted
BMCBI
2011
15 years 7 days ago
Errors in CGAP xProfiler and cDNA DGED: the importance of library parsing and gene selection algorithms
Background: The Cancer Genome Anatomy Project (CGAP) xProfiler and cDNA Digital Gene Expression Displayer (DGED) have been made available to the scientific community over a decade...
Andrew T. Milnthorpe, Mikhail Soloviev
SSD
2009
Springer
233views Database» more  SSD 2009»
15 years 12 months ago
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
Chi-Yin Chow, Mohamed F. Mokbel, Joe Naps, Suman N...
IACR
2011
87views more  IACR 2011»
14 years 5 months ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao