Sciweavers

681 search results - page 28 / 137
» et 2006
Sort
View
TCS
2008
14 years 9 months ago
A note on the problem of reporting maximal cliques
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...
Frédéric Cazals, Chinmay Karande
ACL
2012
12 years 12 months ago
Akamon: An Open Source Toolkit for Tree/Forest-Based Statistical Machine Translation
We describe Akamon, an open source toolkit for tree and forest-based statistical machine translation (Liu et al., 2006; Mi et al., 2008; Mi and Huang, 2008). Akamon implements all...
Xianchao Wu, Takuya Matsuzaki, Jun-ichi Tsujii
ICML
2007
IEEE
15 years 10 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
IJNSEC
2007
126views more  IJNSEC 2007»
14 years 9 months ago
Elliptic Curve Cryptography Based Wireless Authentication Protocol
Recently, Aydos et al. proposed an ECC-based wireless authentication protocol. Because their protocol is based on ECC, the protocol has significant advantage including lower comp...
Yongliang Liu, Wen Gao, Hongxun Yao, Xinghua Yu
SIGIR
2006
ACM
15 years 3 months ago
Finding near-duplicate web pages: a large-scale evaluation of algorithms
Broder et al.’s [3] shingling algorithm and Charikar’s [4] random projection based approach are considered “state-of-theart” algorithms for finding near-duplicate web pag...
Monika Rauch Henzinger