Sciweavers

359 search results - page 30 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
14 years 1 months ago
Mod/Resc Parsimony Inference
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
CAD
2006
Springer
13 years 9 months ago
Field modeling with sampled distances
Traditional mesh-based approaches to the modeling and analysis of physical fields within geometric models require some form of topological reconstruction and conversion in the mes...
Michael Freytag, Vadim Shapiro, Igor G. Tsukanov
SAT
2004
Springer
113views Hardware» more  SAT 2004»
14 years 2 months ago
Clause Form Conversions for Boolean Circuits
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
Paul Jackson, Daniel Sheridan
DEXA
2009
Springer
153views Database» more  DEXA 2009»
14 years 26 days 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, ...
COCOA
2008
Springer
13 years 10 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth