Sciweavers

36 search results - page 5 / 8
» Exploiting Upper Approximation in the Rough Set Methodology
Sort
View
EUROIMSA
2006
111views Multimedia» more  EUROIMSA 2006»
13 years 10 months ago
Exaggeration of Extremely Detailed 3D Faces
Exaggeration is often used in art and entertainment to capture the interest and attention of an audience. We present an approach to automatically exaggerate the distinctive featur...
Andrew Soon, Won-Sook Lee
FSTTCS
2006
Springer
14 years 6 days ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
ICWE
2010
Springer
14 years 1 months ago
Ranking the Linked Data: The Case of DBpedia
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 11 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
14 years 8 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...