Sciweavers

510 search results - page 46 / 102
» How Should We Solve Search Problems Privately
Sort
View
CAISE
2007
Springer
14 years 2 months ago
Personalizing PageRank-Based Ranking over Distributed Collections
In distributed work environments, where users are sharing and searching resources, ensuring an appropriate ranking at remote peers is a key problem. While this issue has been inves...
Stefania Costache, Wolfgang Nejdl, Raluca Paiu
IV
2009
IEEE
191views Visualization» more  IV 2009»
14 years 3 months ago
An Heuristic for the Construction of Intersection Graphs
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
Paolo Simonetto, David Auber
ECCV
2008
Springer
14 years 10 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
COMSNETS
2012
199views more  COMSNETS 2012»
12 years 4 months ago
Varanus: More-with-less fault localization in data centers
Abstract—Detecting and localizing performance faults is crucial for operating large enterprise data centers. This problem is relatively straightforward to solve if each entity (a...
Vaishali P. Sadaphal, Maitreya Natu, Harrick M. Vi...
WWW
2010
ACM
14 years 3 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla