Sciweavers

1346 search results - page 84 / 270
» On the number of rectangular partitions
Sort
View
SAC
2005
ACM
15 years 3 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
ICALP
2011
Springer
14 years 1 months ago
Clustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Daniel Lokshtanov, Dániel Marx
ICCAD
2006
IEEE
101views Hardware» more  ICCAD 2006»
15 years 6 months ago
A spectrally accurate integral equation solver for molecular surface electrostatics
Electrostatic analysis of complicated molecular surfaces arises in a number of nanotechnology applications including: biomolecule design, carbon nanotube simulation, and molecular...
Shih-Hsien Kuo, Jacob White
BMCBI
2008
142views more  BMCBI 2008»
14 years 10 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
COMBINATORICS
2000
81views more  COMBINATORICS 2000»
14 years 9 months ago
Interchangeability of Relevant Cycles in Graphs
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Petra M. Gleiss, Josef Leydold, Peter F. Stadler