Sciweavers

2244 search results - page 135 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
ICIP
2001
IEEE
16 years 8 months ago
A new efficient algorithm for fitting of rectangles and squares
In this paper, we introduce a completely new approach to fitting rectangles and squares to given closed regions using our published ideas in [6], [7], [8]. In these papers, we hav...
Herbert Süße, Klaus Voss
DAC
2005
ACM
15 years 8 months ago
Multi-frequency wrapper design and optimization for embedded cores under average power constraints
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
Qiang Xu, Nicola Nicolici, Krishnendu Chakrabarty
CORR
2006
Springer
68views Education» more  CORR 2006»
15 years 6 months ago
A rigorous proof of the cavity method for counting matchings
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
Mohsen Bayati, Chandra Nair
IPSN
2009
Springer
16 years 1 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
EMMCVPR
1997
Springer
15 years 10 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann