Sciweavers

3415 search results - page 331 / 683
» Lower bounds on kernelization
Sort
View
ISMVL
2003
IEEE
85views Hardware» more  ISMVL 2003»
16 years 7 hour ago
On the Average Path Length in Decision Diagrams of Multiple-Valued Functions
We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate t...
Jon T. Butler, Tsutomu Sasao
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 11 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
15 years 11 months ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang
GD
1997
Springer
15 years 11 months ago
Area Requirements for Drawing Hierarchically Planar Graphs
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
Xuemin Lin, Peter Eades
181
Voted
ICDCN
2010
Springer
15 years 10 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan