363 search results - page 65 / 73 » Partial Multicuts in Trees |
122
Voted
COMBINATORICA
2006
15 years 1 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
136
click to vote
IANDC
2007
15 years 1 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
108
Voted
CGA
2005
15 years 1 months ago
2005
We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions...
95
Voted
COMBINATORICS
2000
15 years 1 months ago
2000
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
178
Voted
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...