Sciweavers

780 search results - page 83 / 156
» Cost-Sharing Approximations for h
Sort
View
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
15 years 12 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 11 months ago
High-throughput Protein Interactome Data: Minable or Not?
There is an emerging trend in post-genome biology to study the collection of thousands of protein interaction pairs (protein interactome) derived from high-throughput experiments....
Jake Yue Chen, Andrey Y. Sivachenko, Lang Li
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 8 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
TMI
1998
75views more  TMI 1998»
14 years 11 months ago
Predicting error in rigid-body, point-based registration
— Guidance systems designed for neurosurgery, hip surgery, and spine surgery, and for approaches to other anatomy that is relatively rigid can use rigid-body transformations to a...
J. Michael Fitzpatrick, Jay B. West, Calvin R. Mau...
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 2 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...