Sciweavers

1055 search results - page 162 / 211
» Enumerations in computable structure theory
Sort
View
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
SPAA
2005
ACM
14 years 1 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal
SAC
2004
ACM
14 years 1 months ago
On using collection for aggregation and association relationships in XML object-relational storage
XML data can be stored in different databases including ObjectRelational Database (ORDB). Using ORDB, we get the benefit of the relational maturity and the richness of OO modeling...
Eric Pardede, J. Wenny Rahayu, David Taniar
CW
2002
IEEE
14 years 24 days ago
Topological Morphing Using Reeb Graphs
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their cont...
Pizzanu Kanonchayos, Tomoyuki Nishita, Yoshihisa S...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 1 days ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu