Sciweavers

511 search results - page 71 / 103
» The intrinsic dimensionality of graphs
Sort
View
NIPS
2000
13 years 11 months ago
A Neural Probabilistic Language Model
A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dim...
Yoshua Bengio, Réjean Ducharme, Pascal Vinc...
ICCV
2009
IEEE
15 years 3 months ago
Video Scene Understanding Using Multi-scale Analysis
We propose a novel method for automatically discover-ing key motion patterns happening in a scene by observing the scene for an extended period. Our method does not rely on object ...
Yang Yang, Jingen Liu, Mubarak Shah
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 10 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
IPPS
2000
IEEE
14 years 2 months ago
Connectivity Models for Optoelectronic Computing Systems
Abstract. Rent's rule and related concepts of connectivity such as dimensionality, line-length distributions, and separators have found great use in fundamental studies of di ...
Haldun M. Özaktas
BMCBI
2007
137views more  BMCBI 2007»
13 years 10 months ago
Bayesian refinement of protein functional site matching
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
Kanti V. Mardia, Vysaul B. Nyirongo, Peter J. Gree...