Sciweavers

10 search results - page 2 / 2
» String Extension Learning Using Lattices
Sort
View
ALT
2006
Springer
14 years 4 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
FASE
2008
Springer
13 years 9 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
PKC
2012
Springer
279views Cryptology» more  PKC 2012»
11 years 10 months ago
Circular and KDM Security for Identity-Based Encryption
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
Jacob Alperin-Sheriff, Chris Peikert
PAMI
2012
11 years 10 months ago
LDAHash: Improved Matching with Smaller Descriptors
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
Christoph Strecha, Alexander A. Bronstein, Michael...
BMCBI
2006
154views more  BMCBI 2006»
13 years 7 months ago
Automated recognition of malignancy mentions in biomedical literature
Background: The rapid proliferation of biomedical text makes it increasingly difficult for researchers to identify, synthesize, and utilize developed knowledge in their fields of ...
Yang Jin, Ryan T. McDonald, Kevin Lerman, Mark A. ...