Sciweavers

9842 search results - page 1669 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
16 years 5 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
165
Voted
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
16 years 5 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf
249
Voted
POPL
2006
ACM
16 years 5 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
166
Voted
RECOMB
2006
Springer
16 years 5 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
RECOMB
2002
Springer
16 years 5 months ago
Revealing protein structures: a new method for mapping antibody epitopes
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
Brendan Mumey, Brian W. Bailey, Edward A. Dratz
« Prev « First page 1669 / 1969 Last » Next »