Sciweavers

1083 search results - page 156 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
TON
2010
138views more  TON 2010»
14 years 4 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng
ICALP
2009
Springer
15 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
ICPR
2008
IEEE
15 years 4 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
GECCO
2004
Springer
115views Optimization» more  GECCO 2004»
15 years 3 months ago
Parameter-Less Hierarchical BOA
Abstract. The parameter-less hierarchical Bayesian optimization algorithm (hBOA) enables the use of hBOA without the need for tuning parameters for solving each problem instance. T...
Martin Pelikan, Tz-Kai Lin
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 2 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell