Sciweavers

860 search results - page 105 / 172
» Biased Random Walks
Sort
View
EWCBR
2006
Springer
15 years 1 months ago
Rough Set Feature Selection Algorithms for Textual Case-Based Classification
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
Kalyan Moy Gupta, David W. Aha, Philip Moore
BNCOD
2007
236views Database» more  BNCOD 2007»
14 years 11 months ago
Wordrank: A Method for Ranking Web Pages Based on Content Similarity
This paper presents WordRank, a new page ranking system, which exploits similarity between interconnected pages. WordRank introduces the model of the ‘biased surfer’ which is ...
Apostolos Kritikopoulos, Martha Sideri, Iraklis Va...
ASWEC
2010
IEEE
14 years 10 months ago
On the Use of Properties in Java Applications
—When building software systems, developers have to weigh the benefits of using one specific solution approach against the risks and costs of using another one. This process is...
Markus Lumpe, Samrian Mahmud, Rajesh Vasa
ENTCS
2007
89views more  ENTCS 2007»
14 years 9 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 9 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber