1548 search results - page 266 / 310 » Data sharing between ada and C C |
104
click to vote
KDD
2006
ACM
16 years 6 days ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
NIPS
1998
15 years 1 months ago
1998
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...
BMCBI
2008
14 years 12 months ago
2008
Background: Innumerable biological investigations require comparing collections of molecules, cells or organisms to one another with respect to one or more of their properties. Al...
SIGMETRICS
2011
ACM
14 years 2 months ago
2011
ACM
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ï¬...
197
click to vote
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...