Sciweavers

780 search results - page 69 / 156
» Reasoning about sets using redescription mining
Sort
View
105
Voted
NFM
2011
252views Formal Methods» more  NFM 2011»
14 years 7 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
97
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 25 days ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
89
Voted
CVPR
2010
IEEE
15 years 9 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
105
Voted
KDD
2006
ACM
172views Data Mining» more  KDD 2006»
16 years 1 months ago
Attack detection in time series for recommender systems
Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recom...
Sheng Zhang, Amit Chakrabarti, James Ford, Fillia ...
96
Voted
PST
2008
15 years 2 months ago
Utility of Knowledge Extracted from Unsanitized Data when Applied to Sanitized Data
Knowledge discovery systems extract knowledge from data that can be used for making prediction about incomplete data items. Utility is a measure of the usefulness of the discovere...
Michal Sramka, Reihaneh Safavi-Naini, Jörg De...