Sciweavers

2996 search results - page 128 / 600
» Numberings and Randomness
Sort
View
ICML
2010
IEEE
15 years 6 months ago
Conditional Topic Random Fields
Generative topic models such as LDA are limited by their inability to utilize nontrivial input features to enhance their performance, and many topic models assume that topic assig...
Jun Zhu, Eric P. Xing
142
Voted
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 5 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
15 years 5 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
179
Voted
ML
2010
ACM
141views Machine Learning» more  ML 2010»
15 years 3 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
TPDS
2010
135views more  TPDS 2010»
15 years 3 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat