Sciweavers

10608 search results - page 712 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
EJC
2010
15 years 7 months ago
On the distance between the expressions of a permutation
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
Patrick Dehornoy, Marc Autord
IJON
2006
127views more  IJON 2006»
15 years 7 months ago
Evolved neural networks based on cellular automata for sensory-motor controller
Constructing the controller of a mobile robot has several issues to be addressed: how to automate behavior generation procedure, how to insert available domain knowledge effective...
Kyung-Joong Kim, Sung-Bae Cho
TNN
2008
182views more  TNN 2008»
15 years 7 months ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
TOG
2008
95views more  TOG 2008»
15 years 7 months ago
Spectral quadrangulation with orientation and alignment control
This paper presents a new quadrangulation algorithm, extending the spectral surface quadrangulation approach where the coarse quadrangular structure is derived from the Morse-Smal...
Jin Huang, Muyang Zhang, Jin Ma, Xinguo Liu, Leif ...
TOPLAS
2002
89views more  TOPLAS 2002»
15 years 7 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua