4112 search results - page 55 / 823 » Efficient Algorithms for the Spoonerism Problem |
152
click to vote
JMLR
2010
14 years 10 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
139
click to vote
PPL
2010
14 years 10 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
143
click to vote
HASE
2007
IEEE
15 years 7 months ago
2007
IEEE
Many problems in high assurance systems design are only tractable using computationally expensive search algorithms. For these algorithms to be useful, designers must be provided ...
144
click to vote
ICDT
2007
ACM
15 years 7 months ago
2007
ACM
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
133
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
In this paper we present a new efficient algorithm for retiming sequential circuits with edge-triggered registers under both setup and hold constraints. Compared with the previous...