Sciweavers

321 search results - page 33 / 65
» Partitioning by iterative deletion
Sort
View
PR
2008
123views more  PR 2008»
13 years 10 months ago
Extensions of vector quantization for incremental clustering
In this paper, we extend the conventional vector quantization by incorporating a vigilance parameter, which steers the tradeoff between plasticity and stability during incremental...
Edwin Lughofer
BMCBI
2005
140views more  BMCBI 2005»
13 years 10 months ago
JACOP: A simple and robust method for the automated classification of protein sequences with modular architecture
Background: Whole-genome sequencing projects are rapidly producing an enormous number of new sequences. Consequently almost every family of proteins now contains hundreds of membe...
Peter Sperisen, Marco Pagni
IPL
2008
97views more  IPL 2008»
13 years 9 months ago
Dynamic polar diagram
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
Bahram Sadeghi Bigham, Ali Mohades, Lidia M. Orteg...
TKDE
2008
154views more  TKDE 2008»
13 years 9 months ago
Watermarking Relational Databases Using Optimization-Based Techniques
Proving ownership rights on outsourced relational databases is a crucial issue in today internet-based application environments and in many content distribution applications. In th...
Mohamed Shehab, Elisa Bertino, Arif Ghafoor
COMBINATORICA
2010
13 years 5 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...