Sciweavers

3008 search results - page 486 / 602
» Independence in connected graphs
Sort
View
235
Voted
TKDE
1998
163views more  TKDE 1998»
15 years 6 months ago
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
—We investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called partition...
Jonathan E. Cook, Alexander L. Wolf, Benjamin G. Z...
TNN
1998
111views more  TNN 1998»
15 years 6 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 6 months ago
Coupling Component Systems towards Systems of Systems
Systems of systems (SoS) are a hot topic in our "fully connected global world". Our aim is not to provide another definition of what SoS are, but rather to focus on the a...
Frédéric Autran, Jean-Philippe Auzel...
CIKM
2010
Springer
15 years 5 months ago
Meta-metadata: a metadata semantics language for collection representation applications
Collecting, organizing, and thinking about diverse information resources is the keystone of meaningful digital information experiences, from research to education to leisure. Meta...
Andruid Kerne, Yin Qu, Andrew M. Webb, Sashikanth ...
IEEESP
2010
99views more  IEEESP 2010»
15 years 5 months ago
The Iterated Weakest Link
Abstract. We devise a model for security investment that reflects dynamic interaction between a defender, who faces uncertainty, and an attacker, who repeatedly targets the weakes...
Rainer Böhme, Tyler Moore