Sciweavers

206 search results - page 26 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 9 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...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 9 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
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...
VLDB
2004
ACM
158views Database» more  VLDB 2004»
14 years 1 months ago
REHIST: Relative Error Histogram Construction Algorithms
Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, such as V-Optimal, optim...
Sudipto Guha, Kyuseok Shim, Jungchul Woo