Sciweavers

335 search results - page 61 / 67
» How to Use Spanning Trees to Navigate in Graphs
Sort
View
IEEEMM
2002
466views more  IEEEMM 2002»
14 years 11 months ago
Measuring Web Application Quality with WebQEM
measuring the product's "lower abstraction attributes."5 We see attributes as measurable properties of an entity--here, a Web application--and propose using a qualit...
Luis Olsina, Gustavo Rossi
SOFTVIS
2010
ACM
14 years 12 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
PAM
2007
Springer
15 years 5 months ago
Two Days in the Life of the DNS Anycast Root Servers
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
Ziqian Liu, Bradley Huffaker, Marina Fomenkov, Nev...
IJCNN
2000
IEEE
15 years 4 months ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
FOCS
2002
IEEE
15 years 4 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg