11394 search results - page 381 / 2279 » Error-Correcting Data Structures |
134
click to vote
ORL
2008
15 years 4 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...
130
click to vote
ADC
2007
Springer
15 years 11 months 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...
125
Voted
ICASSP
2010
IEEE
15 years 5 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 ...
121
click to vote
CORR
2008
Springer
15 years 4 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...
206
click to vote
Publication
Applications that create and consume unstructured data have grown both in scale of storage requirements and complexity of search primitives. We consider two such applications: exha...