1451 search results - page 165 / 291 » Order independence and rationalizability |
184
click to vote
AICCSA
2007
IEEE
16 years 23 days ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
119
click to vote
MFCS
2007
Springer
16 years 16 days ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
156
click to vote
ICMCS
2006
IEEE
16 years 14 days ago
2006
IEEE
A novel video encoding and splicing method is proposed which minimizes the tune-in time of “channel zapping”, i.e. changing from one audiovisual service to another, in IPDC ov...
169
click to vote
ASAP
2005
IEEE
16 years 1 days ago
2005
IEEE
In this paper we introduce a design methodology that allows the system/circuit designer to build reliable systems out of unreliable nano-scale components. The central point of our...
161
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
Simultaneous Broadcast protocols allow different parties to broadcast values in parallel while guaranteeing mutual independence of the broadcast values. In this work, we study va...