Sciweavers

5450 search results - page 1037 / 1090
» Personalization of tagging systems
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 3 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
SWS
2004
ACM
14 years 3 months ago
Trust but verify: authorization for web services
Through web service technology, distributed applications can be built in a exible manner, bringing tremendous power to applications on the web. However, this exibility poses sig...
Christian Skalka, Xiaoyang Sean Wang
UIST
2004
ACM
14 years 3 months ago
A toolkit for managing user attention in peripheral displays
Traditionally, computer interfaces have been confined to conventional displays and focused activities. However, as displays become embedded throughout our environment and daily li...
Tara Matthews, Anind K. Dey, Jennifer Mankoff, Sco...
CCS
2004
ACM
14 years 3 months ago
Web tap: detecting covert web traffic
As network security is a growing concern, system administrators lock down their networks by closing inbound ports and only allowing outbound communication over selected protocols ...
Kevin Borders, Atul Prakash
« Prev « First page 1037 / 1090 Last » Next »