Sciweavers

3894 search results - page 609 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
149
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
Optimizing P2P Streaming Throughput Under Peer Churning
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
Yi Cui, Liang Dai, Yuan Xue
136
Voted
ACSD
2007
IEEE
67views Hardware» more  ACSD 2007»
15 years 10 months ago
Hazard Checking of Timed Asynchronous Circuits Revisited
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
Frédéric Béal, Tomohiro Yoned...
131
Voted
SRDS
2006
IEEE
15 years 9 months ago
Reducing the Availability Management Overheads of Federated Content Sharing Systems
We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparen...
Christopher Peery, Thu D. Nguyen, Francisco Matias...
127
Voted
IMR
2004
Springer
15 years 9 months ago
Surface Mesh Projection for Hexahedral Mesh Generation by Sweeping
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection o...
Xevi Roca, Josep Sarrate, Antonio Huerta
125
Voted
COMPGEOM
1998
ACM
15 years 7 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic