Sciweavers

1487 search results - page 230 / 298
» Representing and Querying Data Transformations
Sort
View
PAMI
2011
14 years 6 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
PVLDB
2010
135views more  PVLDB 2010»
14 years 6 months ago
QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdi...
Jongwuk Lee, Seung-won Hwang
WWW
2004
ACM
16 years 16 days ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
16 years 7 days ago
Mining templates from search result records of search engines
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...
Hongkun Zhao, Weiyi Meng, Clement T. Yu
IPPS
2009
IEEE
15 years 6 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader