Sciweavers

181 search results - page 34 / 37
» Negative selection algorithms without generating detectors
Sort
View
SPAA
1993
ACM
14 years 26 days ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 9 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
14 years 13 days ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
14 years 9 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
EDBT
2009
ACM
96views Database» more  EDBT 2009»
14 years 3 months ago
Top-k dominant web services under multi-criteria matching
As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieva...
Dimitrios Skoutas, Dimitris Sacharidis, Alkis Simi...