Sciweavers

714 search results - page 133 / 143
» An efficient algorithm for positive realizations
Sort
View
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 25 days ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
ICDE
2010
IEEE
562views Database» more  ICDE 2010»
14 years 8 months ago
Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...
CGF
2010
156views more  CGF 2010»
13 years 8 months ago
Mixed Finite Elements for Variational Surface Modeling
Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints....
Alec Jacobson, Elif Tosun, Olga Sorkine, Denis Zor...
IJCV
2006
165views more  IJCV 2006»
13 years 8 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache
BMCBI
2005
109views more  BMCBI 2005»
13 years 8 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...