563 search results - page 26 / 113 » Computing approximate PSD factorizations |
129
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
102
click to vote
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
138
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
111
click to vote
SIGCSE
2010
ACM
15 years 9 months ago
2010
ACM
This paper details the results of an investigation into the compatibility of partnered computer science students. The study involved approximately 290 students at the University o...
144
click to vote
WINE
2007
Springer
15 years 8 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...