Sciweavers

879 search results - page 35 / 176
» Performance Evaluation of Routing Algorithms in RHiNET-2 Clu...
Sort
View
VLDB
1998
ACM
123views Database» more  VLDB 1998»
15 years 10 months ago
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships
Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their correspondin...
Sven Helmer, Till Westmann, Guido Moerkotte
COLING
2008
15 years 7 months ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown
MSWIM
2006
ACM
15 years 12 months ago
Routing in intermittent network topologies
The topic of this paper is the algorithmic development of routing techniques for Delay Tolerant Networks (DTNs). Assuming a store and forward type of network transfers, our main o...
Padma Mundur, Sookyoung Lee, Matthew Seligman
JSA
2006
82views more  JSA 2006»
15 years 5 months ago
A flocking based algorithm for document clustering analysis
ct 7 Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, 8 we present a novel Flocking based approach for doc...
Xiaohui Cui, Jinzhu Gao, Thomas E. Potok
HIPC
2000
Springer
15 years 9 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut