Sciweavers

316 search results - page 59 / 64
» Bounded Depth Data Trees
Sort
View
ISPD
1999
ACM
79views Hardware» more  ISPD 1999»
15 years 4 months ago
Partitioning with terminals: a "new" problem and new benchmarks
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
Charles J. Alpert, Andrew E. Caldwell, Andrew B. K...
IJDAR
2006
131views more  IJDAR 2006»
14 years 11 months ago
Genetic engineering of hierarchical fuzzy regional representations for handwritten character recognition
This paper presents a genetic programming based approach for optimizing the feature extraction step of a handwritten character recognizer. This recognizer uses a simple multilayer ...
Christian Gagné, Marc Parizeau
GLOBECOM
2010
IEEE
14 years 9 months ago
Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...
Weifa Liang, Jun Luo, Xu Xu
87
Voted
CIBCB
2007
IEEE
15 years 6 months ago
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
Moulik Kothari, Bernard M. E. Moret
83
Voted
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
15 years 5 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...