Sciweavers

2095 search results - page 386 / 419
» Improved pebbling bounds
Sort
View
MOBIHOC
2004
ACM
16 years 1 months ago
A single-channel solution for transmission power control in wireless ad hoc networks
Transmission power control (TPC) has a great potential to increase the throughput of a mobile ad hoc network (MANET). Existing TPC schemes achieve this goal by using additional ha...
Alaa Muqattash, Marwan Krunz
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 11 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
EUROSYS
2008
ACM
15 years 11 months ago
Manageable fine-grained information flow
The continuing frequency and seriousness of security incidents underlines the importance of application security. Decentralized information flow control (DIFC), a promising tool ...
Petros Efstathopoulos, Eddie Kohler
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
HCCMeshes: Hierarchical-Culling oriented Compact Meshes
Hierarchical culling is a key acceleration technique used to efficiently handle massive models for ray tracing, collision detection, etc. To support such hierarchical culling, bo...
Tae-Joon Kim, Yongyoung Byun, Yongjin Kim, Bochang...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 10 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young