Sciweavers

3471 search results - page 582 / 695
» Obstacle Numbers of Graphs
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 5 months 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...
RECOMB
2005
Springer
16 years 5 months 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
FOCS
2009
IEEE
15 years 11 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 11 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
INFOCOM
2006
IEEE
15 years 11 months ago
Eclipse Attacks on Overlay Networks: Threats and Defenses
Abstract— Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains connections with a nu...
Atul Singh, Tsuen-Wan Ngan, Peter Druschel, Dan S....