Sciweavers

13784 search results - page 98 / 2757
» On Computing Functions with Uncertainty
Sort
View
FCT
1991
Springer
14 years 14 days ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 4 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 3 months ago
Multiparty Equality Function Computation in Networks with Point-to-Point Links
Abstract. In this paper, we study the problem of computing the multiparty equality (MEQ) function: n 2 nodes, each of which is given an input value from {1,
Guanfeng Liang, Nitin H. Vaidya
JSYML
2010
71views more  JSYML 2010»
13 years 7 months ago
Limitwise monotonic functions, sets, and degrees on computable domains
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
Asher M. Kach, Daniel Turetsky
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda