9209 search results - page 214 / 1842 » Data Space Randomization |
175
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
158
click to vote
CIARP
2009
Springer
16 years 25 days ago
2009
Springer
The concept of probabilistic Latent Semantic Analysis (pLSA) has gained much interest as a tool for feature transformation in image categorization and scene recognition scenarios. ...
188
click to vote
ICPR
2008
IEEE
16 years 20 days ago
2008
IEEE
In this paper we present a method of combining stereo and shape-from-shading information, taking account of the local reliability of each shape estimate. Local estimates of dispar...
216
click to vote
IJCNLP
2005
Springer
15 years 11 months ago
2005
Springer
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...
135
click to vote
SIGCOMM
2000
ACM
15 years 10 months ago
2000
ACM
In this paper, we present a model for TCP/IP ow control mechanism. The rate at which data is transmitted increases linearly in time until a packet loss is detected. At that point,...