Sciweavers

34 search results - page 7 / 7
» Total Colorings Of Degenerate Graphs
Sort
View
FOCS
2007
IEEE
13 years 12 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 5 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
CORR
2010
Springer
44views Education» more  CORR 2010»
13 years 5 months ago
Evolution of National Nobel Prize Shares in the 20th Century
We analyze the evolution of cumulative national shares of Nobel Prizes since 1901, properly taking into account that most prizes were divided among several laureates. We rank by c...
Jürgen Schmidhuber
WINET
2010
185views more  WINET 2010»
13 years 3 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya