Sciweavers

201 search results - page 14 / 41
» A Mathematical Programming Approach to the Kernel Fisher Alg...
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 8 months ago
Approximate counting by dynamic programming
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...
Martin E. Dyer
IPSN
2003
Springer
14 years 25 days ago
Hypothesis Testing over Factorizations for Data Association
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...
EMSOFT
2007
Springer
14 years 1 months ago
The revenge of the overlay: automatic compaction of OS kernel code via on-demand code loading
There is increasing interest in using general-purpose operating systems, such as Linux, on embedded platforms. It is especially important in embedded systems to use memory effici...
Haifeng He, Saumya K. Debray, Gregory R. Andrews
POPL
1991
ACM
13 years 11 months ago
Polymorphic Type Inference and Assignment
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
Xavier Leroy, Pierre Weis
CVPR
2010
IEEE
14 years 1 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan