Sciweavers

1083 search results - page 103 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 8 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
PVLDB
2008
108views more  PVLDB 2008»
15 years 5 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
GRID
2007
Springer
16 years 14 days ago
Data placement for scientific applications in distributed environments
— Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute dat...
Ann L. Chervenak, Ewa Deelman, Miron Livny, Mei-Hu...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
16 years 7 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
SIGMOD
2006
ACM
162views Database» more  SIGMOD 2006»
16 years 6 months ago
Efficient query processing in geographic web search engines
Geographic web search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search tec...
Yen-Yu Chen, Torsten Suel, Alexander Markowetz