Sciweavers

102 search results - page 3 / 21
» On two problems concerning end extensions
Sort
View
SOUPS
2005
ACM
14 years 3 months ago
Two experiences designing for effective security
In our research, we have been concerned with the question of how to make relevant features of security situations visible to users in order to allow them to make informed decision...
Rogério de Paula, Xianghua Ding, Paul Douri...
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
14 years 2 months ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray
CVPR
2006
IEEE
14 years 11 months ago
Selecting Principal Components in a Two-Stage LDA Algorithm
Linear Discriminant Analysis (LDA) is a well-known and important tool in pattern recognition with potential applications in many areas of research. The most famous and used formul...
Aleix M. Martínez, Manli Zhu
AAAI
1996
13 years 11 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
BTW
2005
Springer
107views Database» more  BTW 2005»
14 years 3 months ago
DBMS Architecture - Still an Open Problem
More than two decades ago, DB researchers faced up to the question of how to design a data-independent database management system (DBMS), that is, a DBMS which offers an appropriat...
Theo Härder