Sciweavers

815 search results - page 147 / 163
» Approximate Entropy Reducts
Sort
View
ACL
2011
14 years 1 months ago
A Large Scale Distributed Syntactic, Semantic and Lexical Language Model for Machine Translation
This paper presents an attempt at building a large scale distributed composite language model that simultaneously accounts for local word lexical information, mid-range sentence s...
Ming Tan, Wenli Zhou, Lei Zheng, Shaojun Wang
ICDAR
2011
IEEE
13 years 9 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
86
Voted
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
14 years 10 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
MOBIHOC
2003
ACM
15 years 9 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu
FOCS
2009
IEEE
15 years 4 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...