Sciweavers

1941 search results - page 370 / 389
» On the Hardness of Approximate Reasoning
Sort
View
MOBISYS
2011
ACM
14 years 2 months ago
AppJoy: personalized mobile application discovery
The explosive growth of the mobile application market has made it a significant challenge for the users to find interesting applications in crowded App Stores. To alleviate this...
Bo Yan, Guanling Chen
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 2 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
13 years 11 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
109
Voted
CIKM
2011
Springer
13 years 11 months ago
Semantic data markets: a flexible environment for knowledge management
We present Nyaya, a system for the management of Semantic-Web data which couples a general-purpose and extensible storage mechanism with efficient ontology reasoning and querying ...
Roberto De Virgilio, Giorgio Orsi, Letizia Tanca, ...
IACR
2011
158views more  IACR 2011»
13 years 11 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...