5624 search results - page 423 / 1125 » On Conditional Covering Problem |
159
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
156
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Many people do not read easily. They may have an impairment such as a visual problem. They may be reading in stressful conditions or poor light, or perhaps they are reading in a s...
180
click to vote
CAI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
162
click to vote
DEXA
2009
Springer
16 years 1 months ago
2009
Springer
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...
152
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...