Sciweavers

339 search results - page 33 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
FOCM
2002
97views more  FOCM 2002»
13 years 8 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd
CAMAD
2006
IEEE
14 years 12 days ago
P2PRealm - peer-to-peer network simulator
Abstract--Peer-to-Peer Realm (P2PRealm) is an efficient peer-topeer network simulator for studying algorithms based on neural networks. In contrast to many simulators, which emphas...
Niko Kotilainen, Mikko Vapa, Teemu Keltanen, Annem...
BMCBI
2005
87views more  BMCBI 2005»
13 years 8 months ago
Efficient decoding algorithms for generalized hidden Markov model gene finders
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...
CP
2004
Springer
14 years 2 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
SIGCOMM
2010
ACM
13 years 9 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...