Sciweavers

5757 search results - page 948 / 1152
» Dynamic Policy Programming
Sort
View
CIKM
2005
Springer
14 years 4 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 3 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
IPPS
2000
IEEE
14 years 2 months ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
WCRE
1999
IEEE
14 years 2 months ago
Chava: Reverse Engineering and Tracking of Java Applets
Java applets have been used increasingly on web sites to perform client-side processing and provide dynamic content. While many web site analysis tools are available, their focus ...
Jeffrey L. Korn, Yih-Farn Chen, Eleftherios Koutso...
CSCW
1998
ACM
14 years 2 months ago
Sustaining Mentoring Relationships On-Line
we have documented shares some of the influences discussed by Ackerman et. al., but has unique dynamics of its own which present unique technical and social demands. Using several ...
D. Kevin O'Neill, Louis M. Gomez