Sciweavers

1397 search results - page 35 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
IMAGING
2004
13 years 10 months ago
Tensor Based Feature Detection for Color Images
Extending differential-based operations to color images is hindered by the multi-channel nature of color images. The derivatives in different channels can point in opposite direct...
Joost van de Weijer, Theo Gevers
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
COMGEO
2010
ACM
13 years 8 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 2 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
BMCBI
2007
102views more  BMCBI 2007»
13 years 8 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...