Sciweavers

884 search results - page 9 / 177
» Linear-Input Subset Analysis
Sort
View
JACM
1998
88views more  JACM 1998»
14 years 9 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
PVLDB
2010
125views more  PVLDB 2010»
14 years 8 months ago
Interesting-Phrase Mining for Ad-Hoc Text Analytics
Large text corpora with news, customer mail and reports, or Web 2.0 contributions offer a great potential for enhancing business-intelligence applications. We propose a framework ...
Srikanta J. Bedathur, Klaus Berberich, Jens Dittri...
ASIACRYPT
2010
Springer
14 years 7 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
IJAC
2002
128views more  IJAC 2002»
14 years 9 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
JGS
2000
89views more  JGS 2000»
14 years 9 months ago
Part 2 The Link between GIS and spatial analysis
Abstract: Some ideas are formulated on the challenges presented to GIS, spatial analysis and spatial econometrics that result from recent trends in social science research. These n...
Luc Anselin