8824 search results - page 62 / 1765 » On the Complexity of Real Functions |
109
click to vote
STOC
2009
ACM
16 years 14 days ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
112
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. In data analysis new forms of complex data have to be considered like for example (symbolic data, functional data, web data, trees, SQL query and multimedia data,. . . )....
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— In this paper, we address navigation and coordination methods that allow swarms of robots to converge and spread along complex 2D shapes in environments containing unkn...
141
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...