4526 search results - page 162 / 906 » Algorithmic problems related to the Internet |
124
click to vote
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
144
click to vote
ISAAC
2001
Springer
15 years 9 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
145
click to vote
ARVLSI
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper presents a method for the optimal state assignment of asynchronous state machines. Unlike state assignment for synchronous state machines, state codes must be chosen ca...
128
click to vote
ICWSM
2009
15 years 2 months ago
2009
We present a novel problem of searching for `familiar strangers' in a social network. Familiar strangers are individuals who are not directly connected but exhibit some simil...
135
click to vote
DAM
2002
15 years 4 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...