9176 search results - page 331 / 1836 » algorithms 2010 |
195
click to vote
ENDM
2006
15 years 6 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
151
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
189
click to vote
ADHOC
2010
15 years 6 months ago
2010
Abstract-- The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology manag...
200
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
196
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--In experimental and observational sciences, detecting atypical, peculiar data from large sets of measurements has the potential of highlighting candidates of interesting ...