Sciweavers

142 search results - page 27 / 29
» Estimating the Design Effort of Web Applications
Sort
View
JCDL
2004
ACM
175views Education» more  JCDL 2004»
15 years 3 months ago
Supporting personal collections across digital libraries in spatial hypertext
Creating, maintaining, or using a digital library requires the manipulation of digital documents. Information workspaces provide a visual representation allowing users to collect,...
Frank M. Shipman III, Hao-wei Hsieh, J. Michael Mo...
ICPP
1998
IEEE
15 years 1 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
CIKM
2008
Springer
14 years 11 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
CSCW
2012
ACM
13 years 5 months ago
Predicting tie strength in a new medium
We have friends we consider very close and acquaintances we barely know. The social sciences use the term tie strength to denote this differential closeness with the people in our...
Eric Gilbert