Sciweavers

218 search results - page 21 / 44
» Randomized Weighted Caching with Two Page Weights
Sort
View
ICALP
2011
Springer
14 years 1 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
72
Voted
ICML
2005
IEEE
15 years 10 months ago
Large scale genomic sequence SVM classifiers
In genomic sequence analysis tasks like splice site recognition or promoter identification, large amounts of training sequences are available, and indeed needed to achieve suffici...
Bernhard Schölkopf, Gunnar Rätsch, S&oum...
JSAC
2007
73views more  JSAC 2007»
14 years 9 months ago
Optimal Wavelength Sharing Policies in OBS Networks Subject to QoS Constraints
— We consider the general problem of optimizing the performance of OBS networks with multiple traffic classes subject to strict (absolute) QoS constraints in terms of the end-to...
Li Yang, George N. Rouskas
CONNECTION
2006
101views more  CONNECTION 2006»
14 years 9 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
CEC
2009
IEEE
15 years 4 months ago
Tackling high dimensional nonseparable optimization problems by cooperatively coevolving particle swarms
— This paper attempts to address the question of scaling up Particle Swarm Optimization (PSO) algorithms to high dimensional optimization problems. We present a cooperative coevo...
Xiaodong Li, Xin Yao