Sciweavers

820 search results - page 98 / 164
» Finding low-utility data structures
Sort
View
VLDB
1990
ACM
179views Database» more  VLDB 1990»
14 years 27 days ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish
RELMICS
2000
Springer
14 years 13 days ago
A Relational View of Subgraph Isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
Jordi Cortadella, Gabriel Valiente
DIS
2008
Springer
13 years 10 months ago
Ensemble-Trees: Leveraging Ensemble Power Inside Decision Trees
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
Albrecht Zimmermann
EUC
2008
Springer
13 years 10 months ago
Performance Comparison of Techniques on Static Path Analysis of WCET
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
Mingsong Lv, Zonghua Gu, Nan Guan, Qingxu Deng, Ge...
AAAI
2010
13 years 10 months ago
Adopting Inference Networks for Online Thread Retrieval
Online forums contain valuable human-generated information. End-users looking for information would like to find only those threads in forums where relevant information is present...
Sumit Bhatia, Prasenjit Mitra