Sciweavers

220 search results - page 1 / 44
» Simple image set of (max, ) linear mappings
Sort
View
DAM
2000
69views more  DAM 2000»
13 years 4 months ago
Simple image set of (max, +) linear mappings
Let us denote a b = max(a; b) and a b = a + b for a; b R and extend this pair of operations to matrices and vectors in the same way as in conventional linear algebra, that is i...
Peter Butkovic
CPC
2006
110views more  CPC 2006»
13 years 4 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 4 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
ANOR
2011
117views more  ANOR 2011»
12 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
PODS
2000
ACM
120views Database» more  PODS 2000»
13 years 8 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...