Sciweavers

680 search results - page 68 / 136
» Complexity of Strict Implication
Sort
View
ALT
2001
Springer
14 years 7 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
MOMPES
2009
IEEE
14 years 4 months ago
ArcheOpterix: An extendable tool for architecture optimization of AADL models
For embedded systems quality requirements are equally if not even more important than functional requirements. The foundation for the fulfillment of these quality requirements ha...
Aldeida Aleti, Stefan Björnander, Lars Grunsk...
CIKM
2009
Springer
14 years 4 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
IISWC
2008
IEEE
14 years 4 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
VTC
2008
IEEE
162views Communications» more  VTC 2008»
14 years 4 months ago
A Selective Cluster Index Scheduling Method in OFDMA
—OFDM is an attractive solution for the design of future wireless communications due to its robustness to dispersion in multipath environments. Additional diversity gains can be ...
Marios Nicolaou, Angela Doufexi, Simon Armour