Sciweavers

85 search results - page 8 / 17
» Binary Factor Analysis with Help of Formal Concepts
Sort
View
WWW
2004
ACM
14 years 9 months ago
Incremental formalization of document annotations through ontology-based paraphrasing
For the manual semantic markup of documents to become widespread, users must be able to express annotations that conform to ontologies (or schemas) that have shared meaning. Howev...
Jim Blythe, Yolanda Gil
COCOON
2005
Springer
14 years 2 months ago
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu
CIVR
2007
Springer
128views Image Analysis» more  CIVR 2007»
14 years 2 months ago
An empirical study of inter-concept similarities in multimedia ontologies
Generic concept detection has been a widely studied topic in recent research on multimedia analysis and retrieval, but the issue of how to exploit the structure of a multimedia on...
Markus Koskela, Alan F. Smeaton
DATE
1998
IEEE
103views Hardware» more  DATE 1998»
14 years 25 days ago
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
Enric Pastor, Jordi Cortadella
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 9 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink