3625 search results - page 23 / 725 » On choosing |
103
click to vote
STOC
2004
ACM
16 years 3 days ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
KDD
1998
ACM
15 years 4 months ago
1998
ACM
In many data mining problems the definition of what structures in the database are to be regarded as interesting or valuable is given only loosely. Typically this is regarded as a...
OPODIS
2008
15 years 1 months ago
2008
We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
111
click to vote
SLSFS
2005
Springer
15 years 5 months ago
2005
Springer
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
COMBINATORICS
2006
14 years 12 months ago
2006
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...