Sciweavers

1511 search results - page 88 / 303
» Randomness, lowness and degrees
Sort
View
IJCGA
2002
69views more  IJCGA 2002»
15 years 6 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
15 years 7 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
ICC
2008
IEEE
102views Communications» more  ICC 2008»
16 years 19 days ago
Geometric Random Linear Codes in Sensor Networks
—Wireless sensor networks consist of unreliable and energy-constrained sensors connecting to each other wirelessly. As measured data may be lost due to sensor failures, maintaini...
Yunfeng Lin, Ben Liang, Baochun Li
FAST
2008
15 years 8 months ago
BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage
Flash memory has become the most important storage media in mobile devices, and is beginning to replace hard disks in desktop systems. However, its relatively poor random write pe...
Hyojun Kim, Seongjun Ahn
TDP
2010
124views more  TDP 2010»
15 years 4 months ago
Random Forests for Generating Partially Synthetic, Categorical Data
Abstract. Several national statistical agencies are now releasing partially synthetic, public use microdata. These comprise the units in the original database with sensitive or ide...
Gregory Caiola, Jerome P. Reiter