Sciweavers

14078 search results - page 199 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
INFOCOM
2005
IEEE
16 years 3 days ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
AINA
2004
IEEE
15 years 10 months ago
Topic-Centric Algorithm: A Novel Approach to Web Link Analysis
Link analysis has been used to enhance retrieval results of the web search for years. PageRank and HITS are the two well-known algorithms widely used by most researchers. The form...
Paricha Ingongngam, Arnon Rungsawang
CHI
2011
ACM
14 years 10 months ago
Developmentally situated design (DSD): making theoretical knowledge accessible to designers of children's technology
There is a wealth of theoretical knowledge about the developmental abilities and skills of children. However, this knowledge is not readily accessible to designers of interactive ...
Tilde Bekker, Alissa Nicole Antle
IPPS
1998
IEEE
15 years 10 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
ICASSP
2010
IEEE
15 years 6 months ago
A general formalism for the analysis of distributed algorithms
The major contribution of this paper is the presentation of a general unifying description of distributed algorithms allowing to map local, node-based, algorithms onto a single gl...
Ondrej Sluciak, Thibault Hilaire, Markus Rupp