Sciweavers

JCB
2002
160views more  JCB 2002»
13 years 9 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
JCB
2002
108views more  JCB 2002»
13 years 9 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
CN
1999
114views more  CN 1999»
13 years 9 months ago
An Improved Topology Discovery Algorithm for Networks with Wormhole Routing and Directed Links
We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing. An algorithm of this type was develop...
Ying-Yi Huang, Mart L. Molle
IJON
1998
46views more  IJON 1998»
13 years 9 months ago
Self-organizing maps of symbol strings
SOM and LVQ algorithms for symbol strings have been introduced and applied to isolatedword recognition, for the construction of an optimal pronunciation dictionary for a given spe...
Teuvo Kohonen, Panu Somervuo
JALC
2002
97views more  JALC 2002»
13 years 9 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
IPL
2002
88views more  IPL 2002»
13 years 9 months ago
A note on practical construction of maximum bandwidth paths
Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it ha...
Navneet Malpani, Jianer Chen
IPL
2002
108views more  IPL 2002»
13 years 9 months ago
A heuristic to accelerate in-situ permutation algorithms
In-situ permutation algorithms are algorithms to permute an array of
Jörg Keller
DAM
1998
65views more  DAM 1998»
13 years 9 months ago
Minimization of an M-convex Function
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time sca...
Akiyoshi Shioura
AI
1999
Springer
13 years 9 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
AI
1999
Springer
13 years 9 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter