Sciweavers

1414 search results - page 274 / 283
» Cover Time and Broadcast Time
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 11 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
TAMODIA
2007
13 years 11 months ago
Exploring Usability Needs by Human-Computer Interaction Patterns
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...
Markus Specker, Ina Wentzlaff
BCSHCI
2009
13 years 11 months ago
Initial explorations into the user experience of 3D file browsing
We present an initial exploration into the usability of 3D file browsing. To explore the 3D file browsing technique design space, we analyzed the existing literature and developed...
Anamary Leal, Chadwick A. Wingrave, Joseph J. LaVi...
SIGCOMM
2010
ACM
13 years 10 months ago
Reducing energy consumption in IPTV networks by selective pre-joining of channels
IPTV services are the fastest growing television services in the world today. This is a bandwidth intensive service, requiring low latency and tight control of jitter. To guarante...
Fernando M. V. Ramos, Richard J. Gibbens, Fei Song...
AML
2007
56views more  AML 2007»
13 years 10 months ago
Radin forcing and its iterations
We provide an exposition of supercompact Radin forcing and present several methods for iterating Radin forcing. In this paper we give an exposition of supercompact Radin forcing us...
John Krueger