Sciweavers

2079 search results - page 226 / 416
» Universality of random graphs
Sort
View
NIPS
2003
15 years 8 months ago
Discriminative Fields for Modeling Spatial Dependencies in Natural Images
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...
Sanjiv Kumar, Martial Hebert
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 6 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
IJAHUC
2008
118views more  IJAHUC 2008»
15 years 6 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
IV
1999
IEEE
198views Visualization» more  IV 1999»
15 years 10 months ago
A Prototype Hotel Browsing System Using Java3D
Java3D is an application-centred approach to building 3D worlds. We use Java3D and VRML to design a prototype WWW-based 3D Hotel Browsing system. A Java3D scene graph viewer was i...
D. Ball, Majid Mirmehdi
IFIP
1992
Springer
15 years 10 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski