1963 search results - page 295 / 393 » Applications of Preferences using Answer Set Programming |
ASPLOS
2008
ACM
13 years 10 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
WEA
2010
Springer
14 years 3 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
AGTIVE
2003
Springer
14 years 2 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
CRYPTO
1994
Springer
14 years 28 days ago
1994
Springer
We give cryptographic schemes that help trace the source of leaks when sensitive or proprietary data is made available to a large set of parties. A very relevant application is in ...
BMCBI
2005
13 years 8 months ago
2005
Motivation: In cluster analysis, the validity of specific solutions, algorithms, and procedures present significant challenges because there is no null hypothesis to test and no &...