11212 search results - page 189 / 2243 » Semi-persistent Data Structures |
179
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...
166
click to vote
NIPS
2003
15 years 7 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....
152
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...
145
click to vote
ICASSP
2010
IEEE
15 years 6 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 ...
139
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion...