Sciweavers

1029 search results - page 108 / 206
» Compact representations of ordered sets
Sort
View
KDD
2012
ACM
183views Data Mining» more  KDD 2012»
13 years 4 months ago
Mining discriminative components with low-rank and sparsity constraints for face recognition
This paper introduces a novel image decomposition approach for an ensemble of correlated images, using low-rank and sparsity constraints. Each image is decomposed as a combination...
Qiang Zhang, Baoxin Li
122
Voted
CGF
2007
165views more  CGF 2007»
15 years 2 months ago
Ray-Casted BlockMaps for Large Urban Models Visualization
We introduce a GPU-friendly technique that efficiently exploits the highly structured nature of urban environments to ensure rendering quality and interactive performance of city...
Paolo Cignoni, Marco Di Benedetto, Fabio Ganovelli...
139
Voted
WWW
2006
ACM
16 years 3 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
15 years 6 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
ATAL
2008
Springer
15 years 4 months ago
Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments
Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered i...
Naoki Ohta, Vincent Conitzer, Yasufumi Satoh, Atsu...