Sciweavers

20638 search results - page 3401 / 4128
» Network Computing
Sort
View
NFM
2011
335views Formal Methods» more  NFM 2011»
15 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
MP
2011
14 years 10 months ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng
MP
2011
14 years 10 months ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
PAMI
2011
14 years 10 months ago
CENTRIST: A Visual Descriptor for Scene Categorization
—CENTRIST (CENsus TRansform hISTogram), a new visual descriptor for recognizing topological places or scene categories, is introduced in this paper. We show that place and scene ...
Jianxin Wu, James M. Rehg
CORR
2008
Springer
146views Education» more  CORR 2008»
15 years 7 months ago
Intrusion Detection Using Cost-Sensitive Classification
Intrusion Detection is an invaluable part of computer networks defense. An important consideration is the fact that raising false alarms carries a significantly lower cost than not...
Aikaterini Mitrokotsa, Christos Dimitrakakis, Chri...
« Prev « First page 3401 / 4128 Last » Next »