Sciweavers

3020 search results - page 141 / 604
» Optimal partition trees
Sort
View
PCI
2001
Springer
15 years 11 months ago
Two-Phase Commit Processing with Restructured Commit Tree
Abstract. Extensive research has been carried out in search for an efcient atomic commit protocol and many optimizations have been suggested to improve the basic two-phase commit p...
George Samaras, George K. Kyrou, Panos K. Chrysant...
CCR
1998
140views more  CCR 1998»
15 years 6 months ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
ICASSP
2011
IEEE
14 years 10 months ago
Informed secure watermarking using optimal transport
This paper presents several watermarking methods preventing the estimation of the secret key by an adversary. The constraints for secure embedding using distribution matching, whe...
Patrick Bas
FPGA
1998
ACM
132views FPGA» more  FPGA 1998»
15 years 10 months ago
Circuit Partitioning with Complex Resource Constraints in FPGAs
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...
Huiqun Liu, Kai Zhu, D. F. Wong
EOR
2007
80views more  EOR 2007»
15 years 6 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai