Sciweavers

4524 search results - page 67 / 905
» The Complexity of Global Constraints
Sort
View
116
Voted
BIRTHDAY
2008
Springer
15 years 1 months ago
What Do Semantics Matter When the Meat Is Overcooked?
Abstract. We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the con...
José Luiz Fiadeiro
78
Voted
CAD
1998
Springer
15 years 7 days ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
117
Voted
IJCV
2002
141views more  IJCV 2002»
15 years 7 days ago
Spatio-Temporal Stereo Using Multi-Resolution Subdivision Surfaces
We present a method to automatically extract spatio-temporal descriptions of moving objects from synchronized and calibrated multi-view sequences. The object is modeled by a time-...
Jan Neumann, Yiannis Aloimonos
ICCD
2007
IEEE
183views Hardware» more  ICCD 2007»
15 years 9 months ago
Constraint satisfaction in incremental placement with application to performance optimization under power constraints
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
Huan Ren, Shantanu Dutt
88
Voted
CORR
2008
Springer
57views Education» more  CORR 2008»
15 years 19 days ago
Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
Smarajit Das, B. Sundar Rajan