3360 search results - page 166 / 672 » Opportunistic Data Structures with Applications |
150
Voted
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
134
click to vote
IJON
2010
15 years 1 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
166
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
161
click to vote
ISCAPDCS
2007
15 years 5 months ago
2007
—The tremendous growth in the information culture, efficient digital searches are needed to extract and identify information from huge data. The notion that evolution in silicon ...
137
click to vote
HIPC
2009
Springer
15 years 1 months ago
2009
Springer
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...