Sciweavers

1332 search results - page 50 / 267
» Combinatorial Algorithms
Sort
View
ICASSP
2011
IEEE
13 years 23 days ago
Region-based image fusion using a combinatory Chebyshev-ICA method
The aim of this paper is to provide an algorithm for image fusion which combines the techniques of Chebyshev polynomial (CP) approximation and independent component analysis (ICA)...
Zaid Omar, Nikolaos Mitianoudis, Tania Stathaki
CAD
2005
Springer
13 years 9 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
AAAI
2004
13 years 10 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
DCG
2008
118views more  DCG 2008»
13 years 9 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...