Sciweavers

218 search results - page 30 / 44
» Subexponential Algorithms for Unique Games and Related Probl...
Sort
View
CSDA
2007
105views more  CSDA 2007»
13 years 8 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
14 years 1 months ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl
ICIAP
1997
ACM
14 years 18 days ago
A Divide-and-Conquer Strategy in Recovering Shape of Book Surface from Shading
A strategy in solving the shape from shading problem for the shape and albedo recovery of book surfaces under the fully perspective environment is proposed. The whole recovery proc...
Seong Ik Cho, Hideo Saito, Shinji Ozawa
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 11 months ago
Unsupervised feature selection for linked social media data
The prevalent use of social media produces mountains of unlabeled, high-dimensional data. Feature selection has been shown effective in dealing with high-dimensional data for e...
Jiliang Tang, Huan Liu
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 11 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...