Sciweavers

728 search results - page 81 / 146
» Compressing combinatorial objects
Sort
View
100
Voted
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 22 days ago
On Maximizing Coverage in Gaussian Relay Networks
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
Vaneet Aggarwal, Amir Bennatan, A. Robert Calderba...
101
Voted
CVPR
2004
IEEE
16 years 2 months ago
Approximation of Canonical Sets and Their Applications to 2D View Simplification
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
Trip Denton, Jeff Abrahamson, Ali Shokoufandeh
ICCV
2003
IEEE
16 years 2 months ago
The Local Projective Shape of Smooth Surfaces and their Outlines
This article examines projectively-invariant local geometric properties of smooth curves and surfaces. Oriented projective differential geometry is proposed as a general framework ...
Svetlana Lazebnik, Jean Ponce
81
Voted
ICML
2005
IEEE
16 years 1 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
193
Voted
CP
2009
Springer
16 years 1 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...