Sciweavers

7228 search results - page 264 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CPM
2005
Springer
123views Combinatorics» more  CPM 2005»
15 years 10 months ago
A Simple Fast Hybrid Pattern-Matching Algorithm
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
Frantisek Franek, Christopher G. Jennings, William...
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
16 years 4 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
MOBIHOC
2008
ACM
16 years 4 months ago
Multicast capacity for hybrid wireless networks
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
XuFei Mao, Xiang-Yang Li, ShaoJie Tang
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 10 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 6 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz