Sciweavers

92 search results - page 14 / 19
» Generating Shorter Bases for Hard Random Lattices
Sort
View
DAGSTUHL
2007
14 years 11 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari
94
Voted
ISSTA
2010
ACM
14 years 11 months ago
OCAT: object capture-based automated testing
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
Hojun Jaygarl, Sunghun Kim, Tao Xie, Carl K. Chang
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
15 years 3 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong
WISEC
2010
ACM
15 years 2 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
WSC
2007
14 years 12 months ago
Visualization techniques utilizing the sensitivity analysis of models
Models of real world systems are being increasingly generated from data that describes the behaviour of systems. Data mining techniques, such as Artificial Neural Networks (ANN),...
Ivo Kondapaneni, Pavel Kordík, Pavel Slav&i...