Sciweavers

3055 search results - page 151 / 611
» Randomized Search Trees
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 5 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
CSB
2003
IEEE
14 years 4 months ago
Search for Evolution-Related-Oligonucleotides and Conservative Words in rRNA Sequences
We describe a method for finding ungapped conserved words in rRNA sequences that is effective, utilizes evolutionary information and does not depend on multiple sequence alignment...
Liaofu Luo, Li-Ching Hsieh, Fengmin Ji, Mengwen Ji...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 9 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
14 years 4 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
CPC
1998
154views more  CPC 1998»
13 years 10 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson