Sciweavers

388 search results - page 36 / 78
» Improving Exact Algorithms for MAX-2-SAT
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
JGO
2010
100views more  JGO 2010»
13 years 2 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
TIP
2010
115views more  TIP 2010»
13 years 2 months ago
Constrained and Dimensionality-Independent Path Openings
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
Cris L. Luengo Hendriks
ICASSP
2011
IEEE
12 years 11 months ago
A constrained optimization approach for multi-zone surround sound
A recent approach to surround sound is to perform exact control of the sound field over a region of space. Here, the driving signals for an array of loudspeakers are chosen to cr...
Terence Betlehem, Paul D. Teal
ASPDAC
2007
ACM
80views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Recognition of Fanout-free Functions
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
Tsung-Lin Lee, Chun-Yao Wang