Sciweavers

341 search results - page 59 / 69
» Paired bondage in trees
Sort
View
AAAI
1994
14 years 11 months ago
Using Induction to Refine Information Retrieval Strategies
Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices ...
Catherine Baudin, Barney Pell, Smadar Kedar
FUIN
2007
95views more  FUIN 2007»
14 years 9 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
14 years 9 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
ICNP
1998
IEEE
15 years 1 months ago
On-Demand Multicast in Mobile Wireless Networks
In this paper we propose an "on demand" multicast routing protocol for a wireless, mobile, multihop network. The proposed scheme has two key features: (a) it is based on...
Ching-Chuan Chiang, Mario Gerla
BMCBI
2006
143views more  BMCBI 2006»
14 years 9 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...