Sciweavers

7123 search results - page 400 / 1425
» The Ordered Set of Rough Sets
Sort
View
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 9 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 7 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
ALT
2001
Springer
16 years 3 months ago
Learning How to Separate
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
Sanjay Jain, Frank Stephan
EDBT
2009
ACM
175views Database» more  EDBT 2009»
16 years 1 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
CIKM
2009
Springer
16 years 1 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles