4860 search results - page 582 / 972 » SNPs Problems, Complexity, and Algorithms |
154
Voted
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
146
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
136
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
134
Voted
ICN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
145
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...