Sciweavers

ORL
2006
114views more  ORL 2006»
13 years 9 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster
PR
2008
131views more  PR 2008»
13 years 9 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...
PR
2008
93views more  PR 2008»
13 years 9 months ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach
NJC
2006
102views more  NJC 2006»
13 years 9 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
PPL
2008
124views more  PPL 2008»
13 years 9 months ago
Experimental Evaluation of BSP Programming Libraries
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
Peter Krusche
IDA
2007
Springer
13 years 9 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
PE
2008
Springer
167views Optimization» more  PE 2008»
13 years 9 months ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi
HEURISTICS
2007
76views more  HEURISTICS 2007»
13 years 9 months ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis
PAMI
2008
152views more  PAMI 2008»
13 years 9 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
MTA
2006
195views more  MTA 2006»
13 years 9 months ago
An efficient and robust algorithm for 3D mesh segmentation
Abstract This paper presents an efficient and robust algorithm for 3D mesh segmentation. Segmentation is one of the main areas of 3D object modeling. Most segmentation methods deco...
Lijun Chen 0003, Nicolas D. Georganas