204 search results - page 12 / 41 » On Constrained Minimum Pseudotriangulations |
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICCCN
2007
IEEE
14 years 2 months ago
2007
IEEE
— Autonomous localization of nodes in wireless sensor networks is essential to minimize the complex self organization task and consequently enhancing the overall network lifetime...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
VLSID
2003
IEEE
14 years 8 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...