Sciweavers

4047 search results - page 403 / 810
» The Discrete Basis Problem
Sort
View
ACMSE
2006
ACM
16 years 23 days ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
16 years 11 days ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
FOSSACS
2005
Springer
16 years 10 days ago
Fault Diagnosis Using Timed Automata
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has...
Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza
GECCO
2004
Springer
16 years 5 days ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
ICICS
2004
Springer
16 years 5 days ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa