3020 search results - page 342 / 604 » Optimal partition trees |
245
click to vote
CC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
214
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
260
click to vote
COR
2011
15 years 1 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
254
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
173
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we explore the use of directional antennas in relay transmission to improve the performance of video multicast with omni-directional relays in infrastructurebased wi...