Sciweavers

1920 search results - page 313 / 384
» The Complexity of the A B C Problem
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 2 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
CANS
2007
Springer
150views Cryptology» more  CANS 2007»
14 years 2 months ago
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
Arpita Patra, Bhavani Shankar, Ashish Choudhary, K...
ECBS
2009
IEEE
164views Hardware» more  ECBS 2009»
14 years 3 months ago
Semantically Enhanced Containers for Concurrent Real-Time Systems
Future space missions, such as Mars Science Laboratory, are built upon computing platforms providing a high degree of autonomy and diverse functionality. The increased sophisticat...
Damian Dechev, Peter Pirkelbauer, Nicolas Rouquett...
AML
2008
124views more  AML 2008»
13 years 9 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
CVPR
2008
IEEE
14 years 10 months ago
Conditional density learning via regression with application to deformable shape segmentation
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
Jingdan Zhang, Shaohua Kevin Zhou, Dorin Comaniciu...