Sciweavers

115 search results - page 11 / 23
» Numerical decomposition of geometric constraints
Sort
View
88
Voted
SMA
2008
ACM
150views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Surface matching using consistent pants decomposition
Surface matching is fundamental to shape computing and various downstream applications. This paper develops a powerful pants decomposition framework for computing maps between sur...
Xin Li, Xianfeng Gu, Hong Qin
TSP
2011
106views more  TSP 2011»
14 years 4 months ago
Distributed Estimation and Coding: A Sequential Framework Based on a Side-Informed Decomposition
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
Chao Yu, Gaurav Sharma
ASIASIM
2004
Springer
15 years 3 months ago
Intuitive Control of Dynamic Simulation Using Improved Implicit Constraint Enforcement
Geometric constraints are imperative components of many dynamic simulation systems to effectively control the behavior of simulated objects. In this paper we present an improved fi...
Min Hong, Samuel W. J. Welch, Min-Hyung Choi
TWC
2008
150views more  TWC 2008»
14 years 9 months ago
A Unified Cross-Layer Framework for Resource Allocation in Cooperative Networks
Node cooperation is an emerging and powerful solution that can overcome the limitation of wireless systems as well as improve the capacity of the next generation wireless networks....
Wei Chen, Lin Dai, Khaled Ben Letaief, Zhigang Cao
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 1 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington