Sciweavers

490 search results - page 14 / 98
» Impossibilities for roommate problems
Sort
View
IPSN
2005
Springer
14 years 1 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 11 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
13 years 5 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
DLS
2009
196views Languages» more  DLS 2009»
13 years 5 months ago
Contracts for first-class modules
Behavioral software contracts express properties concerning the flow of values across component (modules, classes, etc) interfaces. These properties are often beyond the reach of ...
T. Stephen Strickland, Matthias Felleisen
ACCV
2010
Springer
13 years 2 months ago
MRF-Based Background Initialisation for Improved Foreground Detection in Cluttered Surveillance Videos
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
Vikas Reddy, Conrad Sanderson, Andres Sanin, Brian...