Sciweavers

373 search results - page 41 / 75
» Counting in Trees for Free
Sort
View
ICPPW
2003
IEEE
14 years 1 months ago
A Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
Loh Peter, Xinhua Zhang
INFOSCALE
2007
ACM
13 years 10 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
ACL
1998
13 years 10 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
COMCOM
2006
100views more  COMCOM 2006»
13 years 8 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
IKE
2003
13 years 10 months ago
A Statistics-Based Approach to Incrementally Update Inverted Files
Many information retrieval systems use the inverted file as indexing structure. The inverted file, however, is not suited to supporting incremental updates when new documents are ...
Wann-Yun Shieh, Chung-Ping Chung