Sciweavers

1258 search results - page 4 / 252
» Table design in dynamic programming
Sort
View
MICRO
2000
IEEE
133views Hardware» more  MICRO 2000»
13 years 11 months ago
Compiler controlled value prediction using branch predictor based confidence
Value prediction breaks data dependencies in a program thereby creating instruction level parallelism that can increase program performance. Hardware based value prediction techni...
Eric Larson, Todd M. Austin
CPAIOR
2010
Springer
14 years 5 days ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 7 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
ICMCS
2007
IEEE
128views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Interactive Visualization Tool with Graphic Table of Video Contents
We present an interactive visualization, called Table Of Video Contents (TOVC), for browsing structured TV programs such as news, magazines or sports. In these telecasts, getting ...
Hervé Goeau, Jérôme Thiè...
PADL
1999
Springer
13 years 11 months ago
CHAT: The Copy-Hybrid Approach to Tabling
The copying approach to tabling (CAT) is an alternative to SLG-WAM and based on incrementally copying the areas that the SLG-WAM freezes to preserve execution states of suspended ...
Bart Demoen, Konstantinos F. Sagonas