Sciweavers

933 search results - page 137 / 187
» Fully automatic cross-associations
Sort
View
AUSDM
2007
Springer
102views Data Mining» more  AUSDM 2007»
15 years 3 months ago
A Two-Step Classification Approach to Unsupervised Record Linkage
Linking or matching databases is becoming increasingly important in many data mining projects, as linked data can contain information that is not available otherwise, or that woul...
Peter Christen
BIOWIRE
2007
Springer
15 years 3 months ago
Self-organizing Desynchronization and TDMA on Wireless Sensor Networks
Desynchronization is a novel primitive for sensor networks: it implies that nodes perfectly interleave periodic events to occur in a round-robin schedule. This primitive can be us...
Julius Degesys, Ian Rose, Ankit Patel, Radhika Nag...
CIARP
2009
Springer
15 years 3 months ago
Particle Swarm Model Selection for Authorship Verification
Authorship verification is the task of determining whether documents were or were not written by a certain author. The problem has been faced by using binary classifiers, one per a...
Hugo Jair Escalante, Manuel Montes-y-Gómez,...
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
15 years 3 months ago
Finding safety errors with ACO
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
Enrique Alba, J. Francisco Chicano
FORMATS
2009
Springer
15 years 3 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker