1051 search results - page 173 / 211 » On the Correspondence between Approximations and Similarity |
170
click to vote
DLOG
2007
15 years 8 months ago
2007
Clio is a joint research project between the University of Toronto and IBM Almaden Research Center started in 1999 to address both foundational and systems issues related to the ma...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
187
click to vote
WINE
2009
Springer
16 years 23 days ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
185
click to vote
STACS
2007
Springer
16 years 8 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
156
click to vote
JCB
2008
15 years 6 months ago
2008
Resolving the general organizational principles that govern the interactions during transcriptional gene regulation has great relevance for understanding disease progression, biof...