5019 search results - page 765 / 1004 » Computing in Quotient Groups |
208
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
217
click to vote
VRML
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents our work and research findings on developing the concept of a multi-user shared environment for culture, performance, art and entertainment. It introduces arti...
246
click to vote
HT
1993
ACM
15 years 11 months ago
1993
ACM
Traditional concurrency control techniques for database systems (transaction management based on locking protocols) have been successful in many multiuser settings, but these tech...
178
click to vote
KDD
1994
ACM
15 years 11 months ago
1994
ACM
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
194
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...