Sciweavers

4797 search results - page 885 / 960
» The complexity of partition tasks
Sort
View
SPAA
2009
ACM
14 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
VEE
2009
ACM
246views Virtualization» more  VEE 2009»
14 years 4 months ago
Tracing for web 3.0: trace compilation for the next generation web applications
Today’s web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the ...
Mason Chang, Edwin W. Smith, Rick Reitmaier, Micha...
CCS
2009
ACM
14 years 4 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...
CSE
2009
IEEE
14 years 4 months ago
TagRec: Leveraging Tagging Wisdom for Recommendation
—Due to the exponential growth of information on the Web, Recommender Systems have been developed to generate suggestions to help users overcome information overload and sift thr...
Tom Chao Zhou, Hao Ma, Irwin King, Michael R. Lyu
INFOCOM
2009
IEEE
14 years 4 months ago
On Fast Optimal STDMA Scheduling over Fading Wireless Channels
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
JiaLiang Zhang, Soung Chang Liew, Liqun Fu