7006 search results - page 479 / 1402 » Approximation Algorithms |
147
click to vote
CPAIOR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
156
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with res...
151
click to vote
ISPD
1998
ACM
15 years 10 months ago
1998
ACM
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
127
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
137
Voted
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...