Sciweavers

5473 search results - page 709 / 1095
» On the graph isomorphism problem
Sort
View
CIKM
1999
Springer
15 years 11 months ago
Page Access Scheduling in Join Processing
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 11 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
CASES
2007
ACM
15 years 10 months ago
An efficient framework for dynamic reconfiguration of instruction-set customization
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
Huynh Phung Huynh, Joon Edward Sim, Tulika Mitra
ICC
2007
IEEE
150views Communications» more  ICC 2007»
15 years 10 months ago
ACE Spectrum of LDPC Codes and Generalized ACE Design
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...
ECML
2006
Springer
15 years 10 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang