Sciweavers

12265 search results - page 40 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
IOR
2011
175views more  IOR 2011»
13 years 4 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
ICASSP
2011
IEEE
13 years 1 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
STOC
2012
ACM
222views Algorithms» more  STOC 2012»
12 years 9 days ago
An analysis of one-dimensional schelling segregation
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...
Christina Brandt, Nicole Immorlica, Gautam Kamath,...
IC3
2009
13 years 7 months ago
Energy Efficiency of Thermal-Aware Job Scheduling Algorithms under Various Cooling Models
One proposed technique to reduce energy consumption of data centers is thermal-aware job scheduling, i.e. job scheduling that relies on predictive thermal models to select among po...
Georgios Varsamopoulos, Ayan Banerjee, Sandeep K. ...
CORR
2011
Springer
217views Education» more  CORR 2011»
13 years 4 months ago
Boolean Networks Design by Genetic Algorithms
Abstract. We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with ...
Andrea Roli, Cristian Arcaroli, Marco Lazzarini, S...