Sciweavers

315 search results - page 34 / 63
» Simple Distributed Weighted Matchings
Sort
View
AAIM
2008
Springer
208views Algorithms» more  AAIM 2008»
13 years 9 months ago
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
Yunhong Zhou, Dennis M. Wilkinson, Robert Schreibe...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
MFCS
2010
Springer
13 years 6 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
SIGIR
2000
ACM
14 years 1 days ago
Partial collection replication versus caching for information retrieval systems
Abstract The explosion of content in distributed information retrieval (IR) systems requires new mechanisms to attain timely and accurate retrieval of unstructured text. In this pa...
Zhihong Lu, Kathryn S. McKinley
DAGSTUHL
2000
13 years 9 months ago
Vision and Touch for Grasping
This paper introduces our one-armed stationary humanoid robot GripSee together with research projects carried out on this platform. The major goal is to have it analyze a table sce...
Rolf P. Würtz