Sciweavers

1763 search results - page 237 / 353
» A Formalization of Polytime Functions
Sort
View
ENTCS
2007
131views more  ENTCS 2007»
14 years 10 months ago
Secure Node Discovery in Ad-hoc Networks and Applications
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
Giovanni Di Crescenzo
CORR
2004
Springer
140views Education» more  CORR 2004»
14 years 9 months ago
Integrating Defeasible Argumentation and Machine Learning Techniques
The field of machine learning (ML) is concerned with the question of how to construct algorithms that automatically improve with experience. In recent years many successful ML app...
Sergio Alejandro Gómez, Carlos Iván ...
CN
2002
98views more  CN 2002»
14 years 9 months ago
New models and algorithms for programmable networks
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...
Danny Raz, Yuval Shavitt
ENTCS
2002
113views more  ENTCS 2002»
14 years 9 months ago
An Operational Semantics for Declarative Multi-Paradigm Languages
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...
CGF
1999
130views more  CGF 1999»
14 years 9 months ago
A Free Form Feature Taxonomy
In this paper the notion of free form feature for aesthetic design is presented. The design of industrial products constituted by free form surfaces is done by using CAD systems r...
M. Fontana, Franca Giannini, M. Meirana