Sciweavers

5393 search results - page 290 / 1079
» Spatial Computing with Labels
Sort
View
CPC
2004
76views more  CPC 2004»
15 years 6 months ago
On Some Parameters in Heap Ordered Trees
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
Kate Morris, Alois Panholzer, Helmut Prodinger
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 10 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
165
Voted
AAAI
2008
15 years 9 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
WWW
2011
ACM
15 years 1 months ago
Analysis and tracking of emotions in english and bengali texts: a computational approach
The present discussion highlights the aspects of an ongoing doctoral thesis grounded on the analysis and tracking of emotions from English and Bengali texts. Development of lexica...
Dipankar Das
192
Voted
IPMI
2009
Springer
16 years 7 months ago
Fully-Automated White Matter Hyperintensity Detection With Anatomical Prior Knowledge and Without FLAIR
This paper presents a method for detection of cerebral white matter hyperintensities (WMH) based on run-time PD-, T1-, and T2weighted structural magnetic resonance (MR) images of t...
Charles DeCarli, Christopher Schwarz, Evan Fletche...