Sciweavers

994 search results - page 125 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
95
Voted
LPNMR
2009
Springer
15 years 7 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
104
Voted
SSD
2007
Springer
176views Database» more  SSD 2007»
15 years 6 months ago
Distributed, Concurrent Range Monitoring of Spatial-Network Constrained Mobile Objects
The ability to continuously monitor the positions of mobile objects is important in many applications. While most past work has been set in Euclidean spaces, the mobile objects rel...
Hua Lu, Zhiyong Huang, Christian S. Jensen, Linhao...
92
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
Robust Location Detection in Emergency Sensor Networks
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
Saikat Ray, Rachanee Ungrangsi, Francesco De Pelle...
CVPR
2008
IEEE
16 years 2 months ago
Correspondence-free multi-camera activity analysis and scene modeling
We propose a novel approach for activity analysis in multiple synchronized but uncalibrated static camera views. We assume that the topology of camera views is unknown and quite a...
Xiaogang Wang, Kinh Tieu, W. Eric L. Grimson
115
Voted
ICML
2007
IEEE
16 years 1 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...