Sciweavers

613 search results - page 36 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 8 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
CVPR
2010
IEEE
14 years 3 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...
SC
2003
ACM
14 years 19 days ago
Scalable Hardware-Based Multicast Trees
This paper presents an algorithm for implementing optimal hardware-based multicast trees, on networks that provide hardware support for collective communication. Although the prop...
Salvador Coll, José Duato, Fabrizio Petrini...
HPCC
2005
Springer
14 years 27 days ago
On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
Youngjin Ahn, Moonseong Kim, Young-Cheol Bang, Hyu...