Sciweavers

4542 search results - page 263 / 909
» Design patterns for data structures
Sort
View
COMSIS
2010
15 years 3 months ago
MFI-tree: An effective multi-feature index structure for weighted query application
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
Yunfeng He, Junqing Yu
COSIT
2009
Springer
114views GIS» more  COSIT 2009»
16 years 1 months ago
Spatio-terminological Inference for the Design of Ambient Environments
We present an approach to assist the smart environment design process by means of automated validation of work-in-progress designs. The approach facilitates validation of not only ...
Mehul Bhatt, Frank Dylla, Joana Hois
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 6 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
IPPS
2008
IEEE
16 years 26 days ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
ICDT
2007
ACM
105views Database» more  ICDT 2007»
16 years 18 days ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...