Sciweavers

10493 search results - page 1417 / 2099
» Dynamic Word Problems
Sort
View
ENTCS
2007
131views more  ENTCS 2007»
15 years 6 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
ENTCS
2007
93views more  ENTCS 2007»
15 years 6 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
ML
2008
ACM
162views Machine Learning» more  ML 2008»
15 years 6 months ago
Incorporating prior knowledge in support vector regression
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
Fabien Lauer, Gérard Bloch
JUCS
2006
92views more  JUCS 2006»
15 years 6 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
JUCS
2006
101views more  JUCS 2006»
15 years 6 months ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...
« Prev « First page 1417 / 2099 Last » Next »