Sciweavers

359 search results - page 54 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
CAV
2005
Springer
104views Hardware» more  CAV 2005»
14 years 1 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
EPIA
2005
Springer
14 years 1 months ago
CONAN: An Integrative System for Biomedical Literature Mining
The amount of information about the genome, transcriptome and proteome, forms a problem for the scientific community: how to find the right information in a reasonable amount of ...
Rainer Malik, Arno Siebes
ATAL
2006
Springer
13 years 11 months ago
Deriving axioms across ontologies
Ontologies play a key role in agent communication and the emerging Semantic Web. Axioms are an important component of ontologies to describe the relationships among the concepts. ...
Dejing Dou, Drew V. McDermott
MOBIHOC
2005
ACM
14 years 7 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber