11211 search results - page 420 / 2243 » Rank-Sensitive Data Structures |
185
click to vote
ERCIMDL
2008
Springer
15 years 8 months ago
2008
Springer
Findings from a data mapping and extraction exercise undertaken as part of the STAR project are described and related to recent work in the area. The exercise was undertaken in con...
168
click to vote
NIPS
2003
15 years 8 months ago
2003
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
159
click to vote
ORL
2008
15 years 6 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
163
click to vote
ADC
2007
Springer
16 years 28 days ago
2007
Springer
A huge diversity of biological databases is available via the Internet, but many of these databases have been developed in an ad hoc manner rather than in accordance with any data...
160
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...