Sciweavers

16430 search results - page 147 / 3286
» On Computable Tree Functions
Sort
View
138
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
144
Voted
ICPP
2009
IEEE
15 years 10 months ago
Load Balance in the Phylogenetic Likelihood Kernel
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...
Alexandros Stamatakis, Michael Ott
NA
2011
296views Computer Vision» more  NA 2011»
14 years 10 months ago
Rational approximation to the Fermi-Dirac function with applications in density functional theory
We are interested in computing the Fermi-Dirac matrix function in which the matrix argument is the Hamiltonian matrix arising from Density Function Theory (DFT) applications. More...
Roger B. Sidje, Yousef Saad
119
Voted
ICMCS
2006
IEEE
117views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Offering Differentiated Services in Peer-to-Peer Multimedia Multicast
In traditional overlay multicast network, all peers are treated as equal regardless of their importance and contribution to the network. In this paper, we consider that each user ...
Kan-Leung Cheng, Xing Jin, S.-H. Gary Chan
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...