Sciweavers

1446 search results - page 79 / 290
» Exploring Knowledge Bases for Similarity
Sort
View
EOR
2010
140views more  EOR 2010»
13 years 6 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
INFOVIS
1999
IEEE
14 years 1 months ago
Cluster and Calendar Based Visualization of Time Series Data
A new method is presented to get insight into univariate time series data. The problem addressed here is how to identify patterns and trends on multiple time scales (days, weeks, ...
Jarke J. van Wijk, Edward R. van Selow
AAAI
2007
13 years 11 months ago
Transposition Tables for Constraint Satisfaction
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
KDD
1994
ACM
125views Data Mining» more  KDD 1994»
14 years 1 months ago
Knowledge Discovery in Large Image Databases: Dealing with Uncertainties in Ground Truth
This paper discusses the problem of knowledge discovery in image databases with particular focus on the issues which arise when absolute ground truth is not available. It is often...
Padhraic Smyth, Michael C. Burl, Usama M. Fayyad, ...
DFT
2008
IEEE
149views VLSI» more  DFT 2008»
13 years 11 months ago
Can Knowledge Regarding the Presence of Countermeasures Against Fault Attacks Simplify Power Attacks on Cryptographic Devices?
Side-channel attacks are nowadays a serious concern when implementing cryptographic algorithms. Powerful ways for gaining information about the secret key as well as various count...
Francesco Regazzoni, Thomas Eisenbarth, Luca Breve...