Sciweavers

16404 search results - page 930 / 3281
» A set coverage problem
Sort
View
SIGIR
2009
ACM
16 years 2 months ago
Topic (query) selection for IR evaluation
The need for evaluating large amounts of topics (queries) makes IR evaluation an uneasy task. In this paper, we study a topic selection problem for IR evaluation. The selection cr...
Jianhan Zhu, Jun Wang, Vishwa Vinay, Ingemar J. Co...
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
16 years 2 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
ICMCS
2007
IEEE
133views Multimedia» more  ICMCS 2007»
16 years 2 months ago
Foreground Segmentation in Surveillance Scenes Containing a Door
We propose a new method for performing accurate background subtraction in scenes with a door, like a building entrance or a hallway. This kind of scene is common in surveillance a...
Andrew Miller, Mubarak Shah
SCALESPACE
2007
Springer
16 years 1 months ago
Restoration of Images with Piecewise Space-Variant Blur
We address the problem of space-variant image deblurring, where different parts of the image are blurred by different blur kernels. Assuming a region-wise space variant point spr...
Leah Bar, Nir A. Sochen, Nahum Kiryati
STACS
2007
Springer
16 years 1 months ago
Associative-Commutative Deducibility Constraints
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...