4886 search results - page 539 / 978 » Approximate Data Exchange |
177
click to vote
FAW
2009
Springer
16 years 1 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
104
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we recursively estimate the magnetic and electric potential of the Earth’s Arctic region. We construct estimates based on data gathered from over 85 magnetomete...
175
click to vote
COMPSAC
2008
IEEE
16 years 1 months ago
2008
IEEE
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
155
click to vote
DCC
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
181
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...