2489 search results - page 355 / 498 » On the Subgroup Distance Problem |
121
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
135
click to vote
ECIS
2003
15 years 5 months ago
2003
Research is being done within the Computer Supported Collaborative Learning community to investigate how to apply the approach of Problem Oriented Project Pedagogy in distance lea...
139
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
169
click to vote
STRINGOLOGY
2004
15 years 5 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
112
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...