Sciweavers

237 search results - page 39 / 48
» Practical and Optimal String Matching
Sort
View
FOCS
1989
IEEE
13 years 10 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
IMECS
2007
13 years 8 months ago
A Common Subexpression Sharing Approach for Multiplierless Synthesis of Multiple Constant Multiplications
—In the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpression-elimination (CSE) algorithm that models synthesis of coefficients into ...
Yuen-Hong Alvin Ho, Chi-Un Lei, Ngai Wong
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
13 years 7 months ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
PAMI
2007
176views more  PAMI 2007»
13 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
PAMI
2010
238views more  PAMI 2010»
13 years 5 months ago
Tracking Motion, Deformation, and Texture Using Conditionally Gaussian Processes
—We present a generative model and inference algorithm for 3D nonrigid object tracking. The model, which we call G-flow, enables the joint inference of 3D position, orientation, ...
Tim K. Marks, John R. Hershey, Javier R. Movellan