7015 search results - page 1163 / 1403 » Approximation algorithms for co-clustering |
156
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
160
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
154
Voted
CIKM
2003
Springer
15 years 9 months ago
2003
Springer
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
151
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
125
Voted
INFOVIS
2002
IEEE
15 years 9 months ago
2002
IEEE
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...