Sciweavers

1497 search results - page 229 / 300
» Online Negative Databases
Sort
View
156
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 5 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
139
Voted
KDD
2012
ACM
166views Data Mining» more  KDD 2012»
13 years 5 months ago
Selecting a characteristic set of reviews
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
Theodoros Lappas, Mark Crovella, Evimaria Terzi
131
Voted
ECCV
2002
Springer
16 years 4 months ago
All the Images of an Outdoor Scene
The appearance of an outdoor scene depends on a variety of factors such as viewing geometry, scene structure and reflectance (BRDF or BTF), illumination (sun, moon, stars, street l...
Srinivasa G. Narasimhan, Chi Wang, Shree K. Nayar
148
Voted
WWW
2008
ACM
16 years 3 months ago
Substructure similarity measurement in chinese recipes
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
Liping Wang, Qing Li, Na Li, Guozhu Dong, Yu Yang
215
Voted
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
16 years 2 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han