Sciweavers

1689 search results - page 72 / 338
» On Natural Non-dcpo Domains
Sort
View
RSA
2006
104views more  RSA 2006»
15 years 6 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
ACL
2010
15 years 4 months ago
Automatically Generating Term Frequency Induced Taxonomies
We propose a novel method to automatically acquire a term-frequency-based taxonomy from a corpus using an unsupervised method. A term-frequency-based taxonomy is useful for applic...
Karin Murthy, Tanveer A. Faruquie, L. Venkata Subr...
EMNLP
2010
15 years 4 months ago
Automatic Discovery of Manner Relations and its Applications
This paper presents a method for the automatic discovery of MANNER relations from text. An extended definition of MANNER is proposed, including restrictions on the sorts of concep...
Eduardo Blanco, Dan I. Moldovan
CVPR
2007
IEEE
16 years 8 months ago
Saliency Detection: A Spectral Residual Approach
The ability of human visual system to detect visual saliency is extraordinarily fast and reliable. However, computational modeling of this basic intelligent behavior still remains...
Xiaodi Hou, Liqing Zhang
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 22 days ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene