Sciweavers

16091 search results - page 3211 / 3219
» Solving
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 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...
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 10 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
CVPR
2012
IEEE
11 years 10 months ago
Weakly supervised structured output learning for semantic segmentation
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
Alexander Vezhnevets, Vittorio Ferrari, Joachim M....
ISCA
2012
IEEE
279views Hardware» more  ISCA 2012»
11 years 10 months ago
Staged memory scheduling: Achieving high performance and scalability in heterogeneous systems
When multiple processor (CPU) cores and a GPU integrated together on the same chip share the off-chip main memory, requests from the GPU can heavily interfere with requests from t...
Rachata Ausavarungnirun, Kevin Kai-Wei Chang, Lava...
ISCA
2012
IEEE
281views Hardware» more  ISCA 2012»
11 years 10 months ago
LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems
Memory system reliability is a serious and growing concern in modern servers. Existing chipkill-level memory protection mechanisms suffer from several drawbacks. They activate a l...
Aniruddha N. Udipi, Naveen Muralimanohar, Rajeev B...
« Prev « First page 3211 / 3219 Last » Next »