Sciweavers

5100 search results - page 947 / 1020
» The Linear Complexity of a Graph
Sort
View
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 4 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
JMLR
2008
151views more  JMLR 2008»
15 years 4 months ago
Learning to Combine Motor Primitives Via Greedy Additive Regression
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
Manu Chhabra, Robert A. Jacobs
PR
2006
101views more  PR 2006»
15 years 4 months ago
Efficient Legendre moment computation for grey level images
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
G. Y. Yang, Huazhong Shu, Christine Toumoulin, Guo...
SIGMETRICS
2008
ACM
179views Hardware» more  SIGMETRICS 2008»
15 years 4 months ago
Xengine: a fast and scalable XACML policy evaluation engine
XACML has become the de facto standard for specifying access control policies for various applications, especially web services. With the explosive growth of web applications depl...
Alex X. Liu, Fei Chen, JeeHyun Hwang, Tao Xie
TIP
2008
85views more  TIP 2008»
15 years 4 months ago
A Scale-Based Connected Coherence Tree Algorithm for Image Segmentation
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...
Jundi Ding, RuNing Ma, Songcan Chen