Sciweavers

284 search results - page 23 / 57
» On Some Polyhedra Covering Problems
Sort
View
TCS
2010
13 years 7 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
VLDB
2001
ACM
107views Database» more  VLDB 2001»
14 years 9 months ago
A survey of approaches to automatic schema matching
Schema matching is a basic problem in many database application domains, such as data integration, Ebusiness, data warehousing, and semantic query processing. In current implementa...
Erhard Rahm, Philip A. Bernstein
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
14 years 3 months ago
SNDL-MOEA: stored non-domination level MOEA
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...
Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilke...
EDBT
2012
ACM
254views Database» more  EDBT 2012»
11 years 11 months ago
Inside "Big Data management": ogres, onions, or parfaits?
In this paper we review the history of systems for managing “Big Data” as well as today’s activities and architectures from the (perhaps biased) perspective of three “data...
Vinayak R. Borkar, Michael J. Carey, Chen Li
ICTAC
2004
Springer
14 years 2 months ago
Replicative - Distribution Rules in P Systems with Active Membranes
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
Tseren-Onolt Ishdorj, Mihai Ionescu