Sciweavers

4212 search results - page 240 / 843
» On Compressible Pairings and Their Computation
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 11 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
IPPS
1999
IEEE
15 years 11 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
CTRS
1987
15 years 10 months ago
Confluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
ICPR
2010
IEEE
15 years 8 months ago
SemiCCA: Efficient Semi-Supervised Learning of Canonical Correlations
Canonical correlation analysis (CCA) is a powerful tool for analyzing multi-dimensional paired data. However, CCA tends to perform poorly when the number of paired samples is limit...
Akisato Kimura, Hirokazu Kameoka, Masashi Sugiyama...
ISSPIT
2010
15 years 1 months ago
Accelerating the Nussinov RNA folding algorithm with CUDA/GPU
Graphics processing units (GPU) on commodity video cards have evolved into powerful computational devices. The RNA secondary structure arises from the primary structure and a backb...
Dar-Jen Chang, Christopher Kimmer, Ming Ouyang