Sciweavers

1191 search results - page 100 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
15 years 2 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
AAAI
1996
14 years 11 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
CVPR
2004
IEEE
15 years 12 months ago
Detecting and Reading Text in Natural Scenes
This paper gives an algorithm for detecting and reading text in natural images. The algorithm is intended for use by blind and visually impaired subjects walking through city scen...
Xiangrong Chen, Alan L. Yuille
DAC
2005
ACM
15 years 10 months ago
Correlation-preserved non-gaussian statistical timing analysis with quadratic timing model
Recent study shows that the existing first order canonical timing model is not sufficient to represent the dependency of the gate delay on the variation sources when processing an...
Lizheng Zhang, Weijen Chen, Yuhen Hu, John A. Gubn...
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 10 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor