Sciweavers

11211 search results - page 2197 / 2243
» Rank-Sensitive Data Structures
Sort
View
INFOCOM
2000
IEEE
14 years 3 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
SIGMOD
2000
ACM
158views Database» more  SIGMOD 2000»
14 years 3 months ago
NiagaraCQ: A Scalable Continuous Query System for Internet Databases
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
Jianjun Chen, David J. DeWitt, Feng Tian, Yuan Wan...
SIGUCCS
2000
ACM
14 years 3 months ago
Three Years in the Solution Center
After thirty-plus years of making small “mid-course corrections” types of changes to the support paradigm, many on the Iowa State University campus thought it was time to make...
Frank Poduska
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 3 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
CHI
1999
ACM
14 years 3 months ago
Design Guidelines for Landmarks to Support Navigation in Virtual Environments
not abstract asymmetry: different sides looks different clumps different from ”data objects” need grid structure, alignment [Design Guidelines for Landmarks to Support Navigati...
Norman G. Vinson
« Prev « First page 2197 / 2243 Last » Next »