Sciweavers

27 search results - page 3 / 6
» Connecting the dots with related notes
Sort
View
ECCC
2011
189views ECommerce» more  ECCC 2011»
13 years 1 months ago
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
Oded Goldreich, Or Meir
TPCTC
2009
Springer
104views Hardware» more  TPCTC 2009»
14 years 23 days ago
The State of Energy and Performance Benchmarking for Enterprise Servers
To address the server industry’s marketing focus on performance, benchmarking organizations have played a pivotal role in developing techniques to determine the maximum achievabl...
Andrew Fanara, Evan Haines, Arthur Howard
DM
1998
95views more  DM 1998»
13 years 5 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...
PODC
2009
ACM
14 years 6 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth