Sciweavers

4218 search results - page 164 / 844
» Complete sets of cooperations
Sort
View
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 10 months ago
Component structure induced by a random walk on a random graph
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
Colin Cooper, Alan M. Frieze
ICPADS
1998
IEEE
14 years 2 months ago
User-Defined Telecooperation Services
A user-defined telecooperation service (UTS) provides service elements for application-specific communication and cooperation processes as well as integrated means for the service...
Volker Gruhn, Peter Herrmann, Heiko Krumm
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 11 months ago
How social structure and institutional order co-evolve beyond instrumental rationality
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
Jae-Woo Kim
PAMI
1998
197views more  PAMI 1998»
13 years 10 months ago
Inference of Integrated Surface, Curve, and Junction Descriptions From Sparse 3D Data
—We are interested in descriptions of 3D data sets, as obtained from stereo or a 3D digitizer. We therefore consider as input a sparse set of points, possibly associated with cer...
Chi-Keung Tang, Gérard G. Medioni
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
14 years 4 months ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes