Sciweavers

733 search results - page 65 / 147
» Recommending random walks
Sort
View
ERCIMDL
2010
Springer
158views Education» more  ERCIMDL 2010»
14 years 11 months ago
Ranking Entities Using Web Search Query Logs
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 10 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
DMTCS
2008
83views Mathematics» more  DMTCS 2008»
14 years 10 months ago
The Location of the First Maximum in the First Sojourn of a Dyck Path
For Dyck paths (nonnegative symmetric) random walks, the location of the first maximum within the first sojourn is studied. Generating functions and explicit resp. asymptotic expre...
Helmut Prodinger
BIOSYSTEMS
2008
69views more  BIOSYSTEMS 2008»
14 years 9 months ago
Investigations into the design principles in the chemotactic behavior of Escherichia coli
Inspired by the recent studies on the analysis of biased random walk behavior of Escherichia coli[Passino, K.M., 2002. Biomimicry of bacterial foraging for distributed optimizatio...
Tae-Hwan Kim, Sung Hoon Jung, Kwang-Hyun Cho
PAMI
2007
196views more  PAMI 2007»
14 years 9 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock