Sciweavers

4009 search results - page 197 / 802
» Clustering on Complex Graphs
Sort
View
139
Voted
KAIS
2006
110views more  KAIS 2006»
15 years 4 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
FOCS
2005
IEEE
15 years 9 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
BMCBI
2010
86views more  BMCBI 2010»
15 years 4 months ago
Protein binding hot spots and the residue-residue pairing preference: a water exclusion perspective
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...
Qian Liu, Jinyan Li
STACS
2000
Springer
15 years 7 months ago
The Complexity of Planarity Testing
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
Eric Allender, Meena Mahajan
ADC
2005
Springer
106views Database» more  ADC 2005»
15 years 9 months ago
OS Support for a Commodity Database on PC clusters - Distributed Devices vs. Distributed File Systems
In this paper we attempt to parallelise a commodity database for OLAP on a cluster of commodity PCs by using a distributed high-performance storage subsystem. By parallelising the...
Felix Rauch, Thomas Stricker