2979 search results - page 219 / 596 » Computation and the Periodic Table |
187
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
157
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
171
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
169
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
On-line adaptation to nonstationary distributions is essential to good performance in image coding. Fixed-size contexts (with adaptive tables) are also widely used, in conjunction...
175
click to vote
ICVS
2009
Springer
16 years 1 months ago
2009
Springer
We propose a new approach for video event learning. The only hypothesis is the availability of tracked object attributes. The approach incrementally aggregates the attributes and r...