Sciweavers

1414 search results - page 246 / 283
» Randomness and Universal Machines
Sort
View
JMLR
2012
12 years 10 days ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
CVPR
2012
IEEE
12 years 9 days ago
Discovering localized attributes for fine-grained recognition
Attributes are visual concepts that can be detected by machines, understood by humans, and shared across categories. They are particularly useful for fine-grained domains where c...
Kun Duan, Devi Parikh, David J. Crandall, Kristen ...
ACL
2012
12 years 9 days ago
Building Trainable Taggers in a Web-based, UIMA-Supported NLP Workbench
Argo is a web-based NLP and text mining workbench with a convenient graphical user interface for designing and executing processing workflows of various complexity. The workbench...
Rafal Rak, BalaKrishna Kolluru, Sophia Ananiadou
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 10 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs