Sciweavers

15351 search results - page 387 / 3071
» The information bottleneck method
Sort
View
107
Voted
MP
2010
135views more  MP 2010»
15 years 2 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
ACL
2010
15 years 1 months ago
A Latent Dirichlet Allocation Method for Selectional Preferences
The computation of selectional preferences, the admissible argument values for a relation, is a well-known NLP task with broad applicability. We present LDA-SP, which utilizes Lin...
Alan Ritter, Mausam, Oren Etzioni
135
Voted
BMVC
2010
15 years 1 months ago
Patch-Cuts: A Graph-Based Image Segmentation Method Using Patch Features and Spatial Relations
In this paper, we present a graph-based image segmentation method (patch-cuts) that incorporates features and spatial relations obtained from image patches. In the first step, pat...
Gerd Brunner, Deepak Roy Chittajallu, Uday Kurkure...
141
Voted
ADC
2010
Springer
204views Database» more  ADC 2010»
14 years 10 months ago
Systematic clustering method for l-diversity model
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
Md. Enamul Kabir, Hua Wang, Elisa Bertino, Yunxian...
159
Voted
HPDC
2011
IEEE
14 years 7 months ago
Algorithm-based recovery for iterative methods without checkpointing
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
Zizhong Chen