1066 search results - page 50 / 214 » Computing Private Set Operations with Linear Complexities |
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Traditional databases have focused on the issue of reducing I/O cost as it is the bottleneck in many operations. As databases become increasingly accepted in areas such as Geograp...
MDM
2007
Springer
15 years 3 months ago
2007
Springer
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
JAIR
2010
14 years 8 months ago
2010
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...