Sciweavers

23 search results - page 3 / 5
» On near-uniform URL sampling
Sort
View
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 8 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
OIR
2006
129views more  OIR 2006»
13 years 7 months ago
Structural analysis of chat messages for topic detection
Purpose - This paper studies the characteristics of chat messages from analyzing a collection of 33,121 sample messages gathered from 1700 sessions of conversations of 72 pairs of...
Haichao Dong, Siu Cheung Hui, Yulan He
CIKM
2008
Springer
13 years 9 months ago
Tag data and personalized information retrieval
Researchers investigating personalization techniques for Web Information Retrieval face a challenge; that the data required to perform evaluations, namely query logs and clickthro...
Mark James Carman, Mark Baillie, Fabio Crestani

Source Code
1894views
14 years 2 months ago
Supervised Image Segmentation Using Markov Random Fields
This is the sample implementation of a Markov random field based image segmentation algorithm described in the following papers: 1. Mark Berthod, Zoltan Kato, Shan Yu, and Josi...
Csaba Gradwohl, Zoltan Kato
DILS
2004
Springer
14 years 1 months ago
Links and Paths through Life Sciences Data Sources
An abundance of biological data sources contain data on classes of scientific entities, such as genes and sequences. Logical relationships between scientific objects are implemen...
Zoé Lacroix, Hyma Murthy, Felix Naumann, Lo...