Sciweavers

387 search results - page 28 / 78
» Towards in-place geometric algorithms and data structures
Sort
View
90
Voted
AUTOMATICA
2006
94views more  AUTOMATICA 2006»
15 years 16 days ago
Subspace identification for FDI in systems with non-uniformly sampled multirate data
This paper proposes a novel subspace approach towards direct identification of a residual model for fault detection and isolation (FDI) in a system with non-uniformly sampled mult...
Weihua Li, Zhengang Han, Sirish L. Shah
BMCBI
2010
150views more  BMCBI 2010»
15 years 17 days ago
MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure
Background: The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of th...
Sriganesh Srihari, Kang Ning, Hon Wai Leong
CIKM
2004
Springer
15 years 5 months ago
Organizing structured web sources by query schemas: a clustering approach
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
Bin He, Tao Tao, Kevin Chen-Chuan Chang
113
Voted
ICDM
2002
IEEE
123views Data Mining» more  ICDM 2002»
15 years 5 months ago
Towards Automatic Generation of Query Taxonomy: A Hierarchical Query Clustering Approach
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...
Shui-Lung Chuang, Lee-Feng Chien
113
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 1 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu