Sciweavers

2254 search results - page 121 / 451
» Computing the minimal covering set
Sort
View
120
Voted
DSN
2007
IEEE
15 years 4 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
ICTIR
2009
Springer
14 years 10 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
110
Voted
SIROCCO
2008
15 years 2 months ago
Distributed Approximation Algorithm for Resource Clustering
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
Olivier Beaumont, Nicolas Bonichon, Philippe Ducho...
WSCG
2004
166views more  WSCG 2004»
15 years 2 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...
84
Voted
CGF
1999
91views more  CGF 1999»
15 years 14 days ago
Efficient and Handy Texture Mapping on 3D Surfaces
There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the pro...
Kenji Matsushita, Toyohisa Kaneko