2969 search results - page 34 / 594 » A space efficient algorithm for group structure computation |
138
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
157
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
153
click to vote
ADC
2003
Springer
15 years 8 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
DCC
2001
IEEE
16 years 2 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
116
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...