Sciweavers

16844 search results - page 3229 / 3369
» How to Design Programs
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 8 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
ISCA
2012
IEEE
232views Hardware» more  ISCA 2012»
13 years 8 months ago
RADISH: Always-on sound and complete race detection in software and hardware
Data-race freedom is a valuable safety property for multithreaded programs that helps with catching bugs, simplifying memory consistency model semantics, and verifying and enforci...
Joseph Devietti, Benjamin P. Wood, Karin Strauss, ...
DAC
2012
ACM
13 years 8 months ago
WCET-centric partial instruction cache locking
Caches play an important role in embedded systems by bridging the performance gap between high speed processors and slow memory. At the same time, caches introduce imprecision in ...
Huping Ding, Yun Liang, Tulika Mitra
C5
2003
IEEE
15 years 11 months ago
SuperSwiki - Bringing collaboration to the class room
SuperSwiki is a not yet well defined term. Its origins go back to Ward Cunningham's Wiki and its Squeak variant, the Swiki. It provides a place to share and edit web pages, f...
Michael Rüger
IANDC
2008
141views more  IANDC 2008»
15 years 6 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
« Prev « First page 3229 / 3369 Last » Next »