Sciweavers

837 search results - page 39 / 168
» Hard combinators
Sort
View
ASIACRYPT
2010
Springer
14 years 9 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
NAACL
2010
14 years 9 months ago
Convolution Kernels for Opinion Holder Extraction
Opinion holder extraction is one of the important subtasks in sentiment analysis. The effective detection of an opinion holder depends on the consideration of various cues on vari...
Michael Wiegand, Dietrich Klakow
JMLR
2010
149views more  JMLR 2010»
14 years 6 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
TASE
2010
IEEE
14 years 6 months ago
Sensor Placement for Triangulation-Based Localization
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Onur Tekdas, Volkan Isler
CORR
2011
Springer
132views Education» more  CORR 2011»
14 years 3 months ago
Spatially-Aware Comparison and Consensus for Clusterings
This paper proposes a new distance metric between clusterings that incorporates information about the spatial distribution of points and clusters. Our approach builds on the idea ...
Parasaran Raman, Jeff M. Phillips, Suresh Venkatas...