Sciweavers

2976 search results - page 202 / 596
» On the bounded integer programming
Sort
View
JMLR
2012
13 years 9 months ago
Bounding the Probability of Error for High Precision Optical Character Recognition
We consider a model for which it is important, early in processing, to estimate some variables with high precision, but perhaps at relatively low recall. If some variables can be ...
Gary B. Huang, Andrew Kae, Carl Doersch, Erik G. L...
ICALP
2010
Springer
15 years 11 months ago
Cell Probe Lower Bounds and Approximations for Range Mode
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
Mark Greve, Allan Grønlund Jørgensen...
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
AIPS
2007
15 years 8 months ago
Bounding the Resource Availability of Activities with Linear Resource Impact
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
Jeremy Frank, Paul H. Morris
ICALP
1997
Springer
15 years 10 months ago
Discrete-Time Control for Rectangular Hybrid Automata
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
Thomas A. Henzinger, Peter W. Kopke