Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
A linear programming technique is introduced that jointly performs feature selection and classifier training so that a subset of features is optimally selected together with the c...
Preserving one's uniquely customized computing environment as one moves to different locations is an enduring challenge in mobile computing. We examine why this capability is...
Mahadev Satyanarayanan, Michael Kozuch, Casey Helf...
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...
In recent years, many researchers are studying object categorization problem. It is reported that bag of keypoints approach which is based on local features without topological in...