Sciweavers

3875 search results - page 503 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
16 years 20 days ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon
WINE
2005
Springer
182views Economy» more  WINE 2005»
16 years 3 days ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...
ISCAS
1999
IEEE
120views Hardware» more  ISCAS 1999»
15 years 11 months ago
Vector median-rational hybrid filters for multichannel image processing
In this letter, a new class of nonlinear filters called vector median-rational hybrid filters (VMRHF's) for multispectral image processing is introduced and applied to the col...
Lazhar Khriji, Moncef Gabbouj
ISSAC
1995
Springer
174views Mathematics» more  ISSAC 1995»
15 years 10 months ago
Numerical Uniformization of Hyperelliptic Curves
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
Klaus-Dieter Semmler, Mika Seppälä
GD
2008
Springer
15 years 7 months ago
Crossing and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
Sergio Cabello, Bojan Mohar