335 search results - page 56 / 67 » How to Use Spanning Trees to Navigate in Graphs |
157
click to vote
CGA
1998
15 years 5 months ago
1998
ns, with large, abstract, multidimensional data sets that are visually represented in multiple ways. We illustrate how spreadsheet techniques provide a structured, intuitive, and p...
210
click to vote
EDBT
2012
ACM
13 years 8 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
135
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...
161
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
166
click to vote
JACM
2000
15 years 5 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...