Sciweavers

2252 search results - page 86 / 451
» Improving Random Forests
Sort
View
CADE
2008
Springer
14 years 8 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
14 years 2 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 2 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
ISQED
2006
IEEE
90views Hardware» more  ISQED 2006»
14 years 2 months ago
Advances in Computation of the Maximum of a Set of Random Variables
This paper quantifies the approximation error in Clark’s approach [1] to computing the maximum (max) of Gaussian random variables; a fundamental operation in statistical timing...
Debjit Sinha, Hai Zhou, Narendra V. Shenoy
IJCNLP
2005
Springer
14 years 1 months ago
Chunking Using Conditional Random Fields in Korean Texts
We present a method of chunking in Korean texts using conditional random fields (CRFs), a recently introduced probabilistic model for labeling and segmenting sequence of data. In a...
Yong-Hun Lee, Mi-Young Kim, Jong-Hyeok Lee