11231 search results - page 2004 / 2247 » Digging for Data Structures |
116
click to vote
NIPS
2007
15 years 4 months ago
2007
Bayesian models of multisensory perception traditionally address the problem of estimating an underlying variable that is assumed to be the cause of the two sensory signals. The b...
140
click to vote
NIPS
2007
15 years 4 months ago
2007
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
134
click to vote
RIAO
2007
15 years 4 months ago
2007
The purpose of text clustering in information retrieval is to discover groups of semantically related documents. Accurate and comprehensible cluster descriptions (labels) let the ...
121
click to vote
SBBD
2007
15 years 4 months ago
2007
We consider the network structure and query processing capabilities of social communities like bookmarks and photo sharing communities such as del.icio.us or flickr. A common fea...
135
click to vote
SODA
2007
ACM
15 years 4 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...