Sciweavers

1804 search results - page 20 / 361
» Ranking for data repairs
Sort
View
RSCTC
2004
Springer
150views Fuzzy Logic» more  RSCTC 2004»
15 years 5 months ago
Extracting Protein-Protein Interaction Sentences by Applying Rough Set Data Analysis
illion abstracts. Problem. How to find sentences that talk about protein-protein interactions? Example (Non-Interaction Sentence) All our data are consistent with models in which ...
Filip Ginter, Tapio Pahikkala, Sampo Pyysalo, Jorm...
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 12 months ago
Distributed Storage Codes Meet Multiple-Access Wiretap Channels
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 2 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
EDBT
2009
ACM
208views Database» more  EDBT 2009»
15 years 6 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
15 years 4 months ago
MashRank: Towards uncertainty-aware and rank-aware mashups
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
Mohamed A. Soliman, Mina Saleeb, Ihab F. Ilyas