Sciweavers

4854 search results - page 675 / 971
» It's the Programming, Stupid
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 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...
CVPR
2012
IEEE
13 years 9 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
ICSE
2012
IEEE-ACM
13 years 9 months ago
Characterizing logging practices in open-source software
—Software logging is a conventional programming practice. While its efficacy is often important for users and developers to understand what have happened in the production run, ...
Ding Yuan, Soyeon Park, Yuanyuan Zhou
215
Voted
CVPR
2009
IEEE
17 years 1 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...