Sciweavers

1382 search results - page 182 / 277
» Formal Analysis of Online Algorithms
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
JAR
2000
145views more  JAR 2000»
15 years 6 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
ICFP
2010
ACM
15 years 7 months ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...
WWW
2004
ACM
16 years 7 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
KDD
2002
ACM
186views Data Mining» more  KDD 2002»
16 years 6 months ago
Topic-conditioned novelty detection
Automated detection of the first document reporting each new event in temporally-sequenced streams of documents is an open challenge. In this paper we propose a new approach which...
Yiming Yang, Jian Zhang, Jaime G. Carbonell, Chun ...