Sciweavers

1414 search results - page 36 / 283
» Completion Energies and Scale
Sort
View
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 21 days ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
IJSI
2008
109views more  IJSI 2008»
13 years 8 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
MSS
2010
IEEE
133views Hardware» more  MSS 2010»
13 years 7 months ago
A trichotomy of attitudes for decision-making under complete ignorance
This paper investigates ‘complete ignorance’ (CI) in the tradition of the CI literature and provides a characterization of possible attitudes toward ignorance. Pessimism, opti...
Ronan Congar, François Maniquet
MIDDLEWARE
2007
Springer
14 years 2 months ago
Garbage Collecting the Grid: A Complete DGC for Activities
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...
Denis Caromel, Guillaume Chazarain, Ludovic Henrio
CORR
2010
Springer
238views Education» more  CORR 2010»
13 years 9 months ago
Face Identification by SIFT-based Complete Graph Topology
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...
Dakshina Ranjan Kisku, Ajita Rattani, Enrico Gross...