Sciweavers

1712 search results - page 246 / 343
» A Computational Approach to Binding Theory
Sort
View
GI
2009
Springer
15 years 4 months ago
Source Conflicts in Bayesian Identification
: In Bayesian identification an ID source is in conflict with the other ID sources, if both provide substantially different, reliable information on a tracked object. After discuss...
Max Krüger, David Hirschhäuser
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 6 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
SACMAT
2009
ACM
16 years 28 days ago
Foundations for group-centric secure information sharing models
We develop the foundations for a theory of Group-Centric Secure Information Sharing (g-SIS), characterize a specific family of models in this arena and identify several direction...
Ram Krishnan, Ravi S. Sandhu, Jianwei Niu, William...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 17 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
KBSE
2005
IEEE
15 years 12 months ago
Automated test generation for engineering applications
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
Songtao Xia, Ben Di Vito, César Muño...