Sciweavers

503 search results - page 50 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
DAGSTUHL
2006
15 years 4 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
139
Voted
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 7 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
IWDW
2005
Springer
15 years 9 months ago
Fingerprinting Schemes. Identifying the Guilty Sources Using Side Information
In a fingerprinting scheme a distributor places marks in each copy of a digital object. Placing different marks in different copies, uniquely identifies the recipient of each cop...
Miguel Soriano, Marcel Fernandez, Josep Cotrina Na...
170
Voted
PDCAT
2005
Springer
15 years 9 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
JCO
2011
113views more  JCO 2011»
14 years 10 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...