Sciweavers

4536 search results - page 215 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
15 years 7 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
16 years 3 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
UAI
2008
15 years 3 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
BMCBI
2010
175views more  BMCBI 2010»
15 years 2 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
SPIRE
2001
Springer
15 years 6 months ago
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...