519 search results - page 32 / 104 » A New Approach to Strongly Polynomial Linear Programming |
110
click to vote
ICLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
112
click to vote
CPM
2010
Springer
15 years 6 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
204
click to vote
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
109
click to vote
DAC
2005
ACM
16 years 2 months ago
2005
ACM
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
NECO
2008
15 years 1 months ago
2008
A new gradient technique is introduced for linear ICA based on the Edgeworth expansion of mutual information, for which the algorithm operates sequentially using fixed-point itera...