Sciweavers

1656 search results - page 153 / 332
» Labeling Schemes with Queries
Sort
View
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 11 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
ADHOC
2005
143views more  ADHOC 2005»
13 years 9 months ago
Active query forwarding in sensor networks
While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mech...
Narayanan Sadagopan, Bhaskar Krishnamachari, Ahmed...
FOCS
2010
IEEE
13 years 7 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
CIKM
2005
Springer
14 years 2 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ICPR
2006
IEEE
14 years 10 months ago
Non-Iterative Two-Dimensional Linear Discriminant Analysis
Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to...
Kohei Inoue, Kiichi Urahama