Sciweavers

304 search results - page 43 / 61
» Roads Belong in Databases
Sort
View
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
STACS
2009
Springer
15 years 4 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
IJCAI
2003
14 years 11 months ago
Bayesian Information Extraction Network
Dynamic Bayesian networks (DBNs) offer an elegant way to integrate various aspects of language in one model. Many existing algorithms developed for learning and inference in DBNs ...
Leonid Peshkin, Avi Pfeffer
77
Voted
KDD
2004
ACM
285views Data Mining» more  KDD 2004»
15 years 3 months ago
Effective localized regression for damage detection in large complex mechanical structures
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
RTSS
2002
IEEE
15 years 2 months ago
STAR: Secure Real-Time Transaction Processing with Timeliness Guarantees
Real-time databases are needed in security-critical applications, e.g., e-commerce, agile manufacturing, and military applications. In these applications, transactions and data it...
Kyoung-Don Kang, Sang Hyuk Son, John A. Stankovic