Sciweavers

1991 search results - page 76 / 399
» Small Models of Large Machines
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Revisiting probabilistic models for clustering with pair-wise constraints
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
Blaine Nelson, Ira Cohen
TPHOL
2007
IEEE
15 years 4 months ago
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
Tom Ridge
AAAI
2008
15 years 5 days ago
Active Learning for Pipeline Models
For many machine learning solutions to complex applications, there are significant performance advantages to decomposing the overall task into several simpler sequential stages, c...
Dan Roth, Kevin Small
SPIRE
2001
Springer
15 years 2 months ago
Speed-up of Aho-Corasick Pattern Matching Machines by Rearranging States
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...
T. Nishimura, Shuichi Fukamachi, Takeshi Shinohara
MLCW
2005
Springer
15 years 3 months ago
An Inference Model for Semantic Entailment in Natural Language
Semantic entailment is the problem of determining if the meaning of a given sentence entails that of another. This is a fundamental problem in natural language understanding that ...
Rodrigo de Salvo Braz, Roxana Girju, Vasin Punyaka...