Sciweavers

1456 search results - page 163 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
CIKM
2001
Springer
14 years 17 days ago
Relevance Score Normalization for Metasearch
Given the ranked lists of documents returned by multiple search engines in response to a given query, the problem of metasearch is to combine these lists in a way which optimizes ...
Mark H. Montague, Javed A. Aslam
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 8 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 6 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
CVPR
2007
IEEE
14 years 10 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz
DISCEX
2003
IEEE
14 years 1 months ago
Detecting Novel Scans Through Pattern Anomaly Detection
We introduce a technique for detecting anomalous patterns in a categorical feature (one that takes values from a finite alphabet). It differs from most anomaly detection methods u...
Alfonso Valdes