Sciweavers

491 search results - page 17 / 99
» Variance and Generalized Constraints for C
Sort
View
IFIP
2004
Springer
14 years 2 months ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
SSIAI
2002
IEEE
14 years 1 months ago
A Wavelet Filter Bank Which Minimizes a Novel Translation Invariant Discrete Uncertainty Measure
We develop a novel measure of joint time-frequency localization applicable to equivalence classes of finite-length discrete signals, which are of increasing importance in modern ...
Peter C. Tay, Joseph P. Havlicek, Victor E. DeBrun...
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
14 years 9 months ago
A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
Evangeline F. Y. Young, Chris C. N. Chu, M. L. Ho
EDBT
2008
ACM
146views Database» more  EDBT 2008»
13 years 10 months ago
SPARQLing constraints for RDF
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machi...
Georg Lausen, Michael Meier 0002, Michael Schmidt
SACMAT
2006
ACM
14 years 2 months ago
Constraint generation for separation of duty
Separation of Duty (SoD) is widely recognized to be a fundamental principle in computer security. A Static SoD (SSoD) policy states that in order to have all permissions necessary...
Hong Chen, Ninghui Li