Sciweavers

363 search results - page 36 / 73
» Partial Multicuts in Trees
Sort
View
IDEAL
2009
Springer
14 years 2 months ago
Web Feed Clustering and Tagging Aggregator Using Topological Tree-Based Self-Organizing Maps
With the rapid and dramatic increase in web feeds published by different publishers, providers or websites via Really Simple Syndication (RSS) and Atom, users cannot be expected t...
Richard T. Freeman
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
14 years 1 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
FCT
2003
Springer
14 years 3 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
BMCBI
2010
121views more  BMCBI 2010»
13 years 10 months ago
Reconstructing genome trees of prokaryotes using overlapping genes
Background: Overlapping genes (OGs) are defined as adjacent genes whose coding sequences overlap partially or entirely. In fact, they are ubiquitous in microbial genomes and more ...
Chih-Hsien Cheng, Chung-Han Yang, Hsien-Tai Chiu, ...
ATAL
2009
Springer
14 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...