Sciweavers

2778 search results - page 156 / 556
» Limit complexities revisited
Sort
View
GI
2004
Springer
15 years 12 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
ACL
1994
15 years 7 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
16 years 7 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
ICPR
2008
IEEE
16 years 7 months ago
Preliminary approach on synthetic data sets generation based on class separability measure
Usually, performance of classifiers is evaluated on real-world problems that mainly belong to public repositories. However, we ignore the inherent properties of these data and how...
Núria Macià, Ester Bernadó-Ma...
ICSE
2008
IEEE-ACM
16 years 7 months ago
Tool support for the navigation in graphical models
Graphical models are omnipresent in the software engineering field, but most current graphical modeling languages do not scale with the increasing size and complexity of today...
Tobias Reinhard, Silvio Meier, Reinhard Stoiber, C...