Sciweavers

1404 search results - page 42 / 281
» Complexity of admissible rules
Sort
View
130
Voted
CAGD
2006
114views more  CAGD 2006»
15 years 3 months ago
Jet subdivision schemes on the k-regular complex
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
Yonggang Xue, Thomas P.-Y. Yu, Tom Duchamp
129
Voted
GRC
2005
IEEE
15 years 9 months ago
Improved rule based rough set approach for target recognition
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
Yong Liu, Congfu Xu, Zhiyong Yan, Yunhe Pan
135
Voted
FCT
2007
Springer
15 years 7 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
152
Voted
AGTIVE
2007
Springer
15 years 7 months ago
Shaped Generic Graph Transformation
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
124
Voted
IJCAI
1997
15 years 4 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu