Sciweavers

180 search results - page 6 / 36
» A Method for Change Computation in Deductive Databases
Sort
View
150
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
15 years 9 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 2 days 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
ICCV
2003
IEEE
15 years 2 months ago
Active Concept Learning for Image Retrieval in Dynamic Databases
Concept learning in content-based image retrieval (CBIR) systems is a challenging task. This paper presents an active concept learning approach based on mixture model to deal with...
Anlei Dong, Bir Bhanu
ACCV
2007
Springer
15 years 3 months ago
Human Pose Estimation from Volume Data and Topological Graph Database
This paper proposes a novel volume-based motion capture method using a bottom-up analysis of volume data and an example topology database of the human body. By using a two-step gra...
Hidenori Tanaka, Atsushi Nakazawa, Haruo Takemura
DEXAW
1998
IEEE
98views Database» more  DEXAW 1998»
15 years 1 months ago
Supporting Read-Only Transactions in Wireless Broadcasting
Wireless communications support a new form of data delivery in which servers broadcast data to a number of clients that listen to the broadcast channel and retrieve data of intere...
Evaggelia Pitoura