Sciweavers

256 search results - page 37 / 52
» Games are up for DVFS
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 4 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
HICSS
2008
IEEE
151views Biometrics» more  HICSS 2008»
15 years 4 months ago
Venice, California and World of Warcraft: Persistence and Ephemerality in Playful Spaces
Persistent digital media extend content beyond immediate ephemeral interactions and conversations. Systems such as email, instant messaging, digital kiosks, social networking site...
Silvia Lindtner, Bonnie A. Nardi
ICRA
2008
IEEE
188views Robotics» more  ICRA 2008»
15 years 4 months ago
CMDragons: Dynamic passing and strategy on a champion robot soccer team
— After several years of developing multiple RoboCup small-size robot soccer teams, our CMDragons robot team achieved a highly successful level of performance, winning both the 2...
James Bruce, Stefan Zickler, Mmichael Licitra, Man...
DSD
2007
IEEE
120views Hardware» more  DSD 2007»
15 years 4 months ago
Latency Minimization for Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
Amir Hossein Ghamarian, Sander Stuijk, Twan Basten...
APSEC
2006
IEEE
15 years 3 months ago
Secrobat: Secure and Robust Component-based Architectures
Software systems, component-based systems (CBS) in particular, have a lot of vulnerabilities that may be exploited by intruders. Companies spend much time and money to “patch”...
Artem Vorobiev, Jun Han