Sciweavers

15485 search results - page 2656 / 3097
» Computing Optimal Subsets
Sort
View
174
Voted
WWW
2007
ACM
16 years 7 months ago
Consistency-preserving caching of dynamic database content
With the growing use of dynamic web content generated from relational databases, traditional caching solutions for throughput and latency improvements are ineffective. We describe...
Niraj Tolia, M. Satyanarayanan
WWW
2006
ACM
16 years 7 months ago
Wake-on-WLAN
In bridging the digital divide, two important criteria are cost-effectiveness, and power optimization. While 802.11 is cost-effective and is being used in several installations in...
Nilesh Mishra, Kameswari Chebrolu, Bhaskaran Raman...
155
Voted
WWW
2003
ACM
16 years 7 months ago
On labeling schemes for the semantic web
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
Vassilis Christophides, Dimitris Plexousakis, Mich...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
166
Voted
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
« Prev « First page 2656 / 3097 Last » Next »