Sciweavers

1200 search results - page 121 / 240
» Marked Ancestor Problems
Sort
View
104
Voted
ALT
2004
Springer
15 years 9 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
FASE
2010
Springer
15 years 7 months ago
Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
Mark Harman
90
Voted
ICC
2009
IEEE
132views Communications» more  ICC 2009»
15 years 7 months ago
Preprocessing DNS Log Data for Effective Data Mining
—The Domain Name Service (DNS) provides a critical function in directing Internet traffic. Defending DNS servers from bandwidth attacks is assisted by the ability to effectively...
Mark E. Snyder, Ravi Sundaram, Mayur Thakur
96
Voted
ICSM
2006
IEEE
15 years 6 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...
102
Voted
IJCNN
2006
IEEE
15 years 6 months ago
Data Fusion for Outlier Detection through Pseudo-ROC Curves and Rank Distributions
— This paper proposes a novel method of fusing models for classification of unbalanced data. The unbalanced data contains a majority of healthy (negative) instances, and a minor...
Paul F. Evangelista, Mark J. Embrechts, Boleslaw K...