6315 search results - page 102 / 1263 » Approximating Solution Structure |
130
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
142
click to vote
DASFAA
2003
IEEE
15 years 8 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
123
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
102
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
to appear in Proc. IEEE Int’l Conf. on Acoustics, Speech, and Signal Processing, March, 2008 High-dynamic-range medical images take intensity values which cannot be visualized o...
125
click to vote
ICDCN
2009
Springer
15 years 7 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...