2569 search results - page 81 / 514 » Approximate Objects and Approximate Theories |
171
click to vote
JACM
2000
15 years 6 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...
163
click to vote
DAC
2011
ACM
14 years 6 months ago
2011
ACM
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
175
click to vote
INFOCOM
2009
IEEE
16 years 29 days ago
2009
IEEE
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
174
click to vote
DILS
2007
Springer
16 years 15 days ago
2007
Springer
2D-Nuclear magnetic resonance (NMR) spectroscopy is a powerful analytical method to elucidate the chemical structure of molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra cor...
223
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...