Sciweavers

1871 search results - page 88 / 375
» The Ephemeral Pairing Problem
Sort
View
ATAL
2003
Springer
15 years 4 months ago
Towards model checking interpreted systems
We show how it is possible to pair the NuSMV model checker with Akka, a software platform used to check validity of propositional modal formulas, to verify properties of multi-age...
Alessio Lomuscio, Franco Raimondi, Marek J. Sergot
ESA
2010
Springer
273views Algorithms» more  ESA 2010»
15 years 10 days ago
Minimum Vertex Cover in Rectangle Graphs
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
MM
2010
ACM
157views Multimedia» more  MM 2010»
14 years 11 months ago
Landmark image retrieval using visual synonyms
In this paper, we consider the incoherence problem of the visual words in bag-of-words vocabularies. Different from existing work, which performs assignment of words based solely ...
Efstratios Gavves, Cees G. M. Snoek
CORR
2006
Springer
114views Education» more  CORR 2006»
14 years 11 months ago
Polynomial-time algorithms for coding across multiple unicasts
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
Tracey Ho
IJNSEC
2008
103views more  IJNSEC 2008»
14 years 11 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao