3096 search results - page 290 / 620 » The Generalized FITC Approximation |
164
click to vote
IWDW
2005
Springer
16 years 3 days ago
2005
Springer
The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework the...
189
click to vote
CINQ
2004
Springer
16 years 21 hour ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
186
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
185
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
142
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
The synthesis theory for spatial linkage systems can be formulated in a way that is compatible with the geometric design of serial and parallel chain robotic systems. Mechanism de...