Sciweavers

847 search results - page 160 / 170
» Approximation algorithms for projective clustering
Sort
View
WWW
2009
ACM
14 years 8 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
ICDE
2011
IEEE
194views Database» more  ICDE 2011»
12 years 11 months ago
Representative skylines using threshold-based preference distributions
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, R...
ICCV
2003
IEEE
14 years 9 months ago
Fast Intensity-based 2D-3D Image Registration of Clinical Data Using Light Fields
Registration of a preoperative CT (3D) image to one or more X-ray projection (2D) images, a special case of the pose estimation problem, has been attempted in a variety of ways wi...
Daniel B. Russakoff, Torsten Rohlfing, Calvin R. M...
DAC
2009
ACM
14 years 2 days ago
Vicis: a reliable network for unreliable silicon
Process scaling has given designers billions of transistors to work with. As feature sizes near the atomic scale, extensive variation and wearout inevitably make margining unecono...
David Fick, Andrew DeOrio, Jin Hu, Valeria Bertacc...
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks