Sciweavers

284 search results - page 32 / 57
» On Some Polyhedra Covering Problems
Sort
View
FLAIRS
2004
13 years 10 months ago
Physical Approximations for Urban Fire Spread Simulations
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
Daniel J. Bertinshaw, Hans W. Guesgen
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 8 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
ECAI
2010
Springer
13 years 10 months ago
A Unified Framework for Non-standard Reasoning Services in Description Logics
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
COMCOM
2006
168views more  COMCOM 2006»
13 years 9 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
BILDMED
2007
109views Algorithms» more  BILDMED 2007»
13 years 10 months ago
A Fast and Flexible Image Registration Toolbox
Abstract. In the last decades there has been tremendous research towards the design of fully automatic non-rigid registration schemes. However, apart from the ITK based implementat...
Nils Papenberg, Hanno Schumacher, Stefan Heldmann,...