Sciweavers

684 search results - page 104 / 137
» A characterization of b-perfect graphs
Sort
View
ICDT
2009
ACM
150views Database» more  ICDT 2009»
16 years 15 days ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
WWW
2002
ACM
16 years 14 days ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...
CISS
2008
IEEE
15 years 6 months ago
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
Peter Marbach
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
15 years 6 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
FOCS
2007
IEEE
15 years 6 months ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav