Sciweavers

9842 search results - page 1897 / 1969
» Problem complexity
Sort
View
HICSS
2002
IEEE
148views Biometrics» more  HICSS 2002»
14 years 3 months ago
Barriers to a Wide-Area Trusted Network Early Warning System for Electric Power Disturbances
It is apparent that perturbations of the North American electric power grid follow the patterns and characteristics of Self Organized Critical (SOC) systems. Published studies sho...
Paul W. Oman, Jeff Roberts
HICSS
2002
IEEE
144views Biometrics» more  HICSS 2002»
14 years 3 months ago
Managing Long Term Communications: Conversation and Contact Management
Contact management is an important part of everyday work. People exchange business cards to try to enter each other’s contact lists. Local businesses provide refrigerator magnet...
Steve Whittaker, Quentin Jones, Loren G. Terveen
MICRO
2002
IEEE
143views Hardware» more  MICRO 2002»
14 years 3 months ago
Effective instruction scheduling techniques for an interleaved cache clustered VLIW processor
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
Enric Gibert, F. Jesús Sánchez, Anto...
VR
2002
IEEE
125views Virtual Reality» more  VR 2002»
14 years 3 months ago
A Scalable, Multi-User VRML Server
VRML97 allows the description of dynamic worlds that can change with both the passage of time, and user interaction. Unfortunately, the current VRML usage model prevents its full ...
Thomas Rischbeck, Paul Watson
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 3 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
« Prev « First page 1897 / 1969 Last » Next »