Sciweavers

4860 search results - page 437 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
TEC
2010
203views more  TEC 2010»
14 years 10 months ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 4 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 4 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
140
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
Distributed Load-Aware Routing in LEO Satellite Networks
—In this paper, we propose a lightweight distributed routing algorithm, called Distributed Load-Aware Routing (DLAR). The proposed protocol adopts a distributed approach to handl...
Evangelos Papapetrou, Fotini-Niovi Pavlidou
145
Voted
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
15 years 9 months ago
Two Dimensional Parameterized Matching
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur