Sciweavers

359 search results - page 7 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
SGAI
2005
Springer
14 years 1 months ago
Geometric Proportional Analogies In Topographic Maps: Theory and Application
This paper details the application of geometric proportional analogies in the sub-classification of polygons within a topographic (land cover) map. The first part of this paper co...
Emma-Claire Mullally, Diarmuid P. O'Donoghue, Amy ...
DCOSS
2005
Springer
14 years 1 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
14 years 11 hour ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 1 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Microlocal Analysis of the Geometric Separation Problem
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy supercluster...
David L. Donoho, Gitta Kutyniok