971 search results - page 126 / 195 » Approximate Satisfiability and Equivalence |
99
Voted
ESA
2000
Springer
15 years 4 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
161
click to vote
DSD
2008
IEEE
15 years 2 months ago
2008
IEEE
Platform-based design represents the most widely used approach to design System-On-Chip (SOC) applications. In this context, the Design Space Exploration (DSE) phase consists of o...
89
Voted
EMNLP
2008
15 years 2 months ago
2008
We present Minimum Bayes-Risk (MBR) decoding over translation lattices that compactly encode a huge number of translation hypotheses. We describe conditions on the loss function t...
83
Voted
IPCO
1996
15 years 2 months ago
1996
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
143
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...