Sciweavers

461 search results - page 91 / 93
» Higher Kurtz randomness
Sort
View
BMCBI
2004
114views more  BMCBI 2004»
13 years 7 months ago
Extending the mutual information measure to rank inferred literature relationships
Background: Within the peer-reviewed literature, associations between two things are not always recognized until commonalities between them become apparent. These commonalities ca...
Jonathan D. Wren
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 7 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
DCG
1998
59views more  DCG 1998»
13 years 7 months ago
A Probabilistic Analysis of the Power of Arithmetic Filters
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
Olivier Devillers, Franco P. Preparata
MANSCI
2010
105views more  MANSCI 2010»
13 years 5 months ago
Revenue Management with Strategic Customers: Last-Minute Selling and Opaque Selling
Companies in a variety of industries (e.g., airlines, hotels, theaters) often use last-minute sales to dispose of unsold capacity. Although this may generate incremental revenues ...
Kinshuk Jerath, Serguei Netessine, Senthil K. Veer...
INFOCOM
2010
IEEE
13 years 5 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu