Sciweavers

4865 search results - page 949 / 973
» The Complexity of Graph Connectivity
Sort
View
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 13 days ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 7 days ago
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
Bart De Moor, Frizo A. L. Janssens, Wolfgang Gl&au...
VLSID
2008
IEEE
138views VLSI» more  VLSID 2008»
16 years 6 days ago
Memory Architecture Exploration Framework for Cache Based Embedded SOC
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
T. S. Rajesh Kumar, C. P. Ravikumar, R. Govindaraj...
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
16 years 6 days ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
RECOMB
2005
Springer
16 years 4 days ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu