Sciweavers

15485 search results - page 2782 / 3097
» Computing Optimal Subsets
Sort
View
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 8 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
15 years 8 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...
VMV
2008
222views Visualization» more  VMV 2008»
15 years 8 months ago
Surface Reconstruction from Fitted Shape Primitives
In this paper we address the problem of reconstructing a structurally simple surface representation from point datasets of scanned scenes as they occur for instance in city scanni...
Philipp Jenke, Bastian Krückeberg, Wolfgang S...
SEBD
2007
121views Database» more  SEBD 2007»
15 years 8 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
WICON
2008
15 years 8 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
« Prev « First page 2782 / 3097 Last » Next »