Sciweavers

398 search results - page 23 / 80
» A new biclustering technique based on crossing minimization
Sort
View
ECCV
2002
Springer
16 years 2 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
98
Voted
VLDB
2004
ACM
101views Database» more  VLDB 2004»
15 years 5 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
97
Voted
VLSID
1999
IEEE
97views VLSI» more  VLSID 1999»
15 years 4 months ago
A New Methodology for Concurrent Technology Development and Cell Library Optimization
To minimize the time to market and cost of new sub 0.25um process technologies and products, PDF Solutions, Inc., has developed a new comprehensive approach based on the use of pr...
Marko P. Chew, Sharad Saxena, Thomas F. Cobourn, P...
112
Voted
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 14 days ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel
97
Voted
ICIP
2005
IEEE
16 years 2 months ago
Joint feature-spatial-measure space: a new approach to highly efficient probabilistic object tracking
In this paper we present a probabilistic framework for tracking objects based on local dynamic segmentation. We view the segn to be a Markov labeling process and abstract it as a ...
Feng Chen, XiaoTong Yuan, ShuTang Yang