Sciweavers

4432 search results - page 591 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
EMMCVPR
2001
Springer
15 years 7 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
117
Voted
ICPR
2000
IEEE
15 years 7 months ago
Scaling-Up Support Vector Machines Using Boosting Algorithm
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
Dmitry Pavlov, Jianchang Mao, Byron Dom
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
15 years 7 months ago
Explaining and Controlling Ambiguity in Dynamic Programming
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Robert Giegerich
ISPD
1999
ACM
94views Hardware» more  ISPD 1999»
15 years 7 months ago
Gate sizing with controlled displacement
- In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use a path-based delay model to capture the timing c...
Wei Chen, Cheng-Ta Hsieh, Massoud Pedram
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
15 years 7 months ago
Minimum area retiming with equivalent initial states
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
Naresh Maheshwari, Sachin S. Sapatnekar