Sciweavers

2778 search results - page 119 / 556
» Limit complexities revisited
Sort
View
EMNLP
2008
15 years 6 months ago
Regular Expression Learning for Information Extraction
Regular expressions have served as the dominant workhorse of practical information extraction for several years. However, there has been little work on reducing the manual effort ...
Yunyao Li, Rajasekar Krishnamurthy, Sriram Raghava...
WSC
1994
15 years 6 months ago
CSIM17: a simulation model-building toolkit
CSIM is a simulation model-building toolkit that is used by C/C++ programmers to implement processoriented, discrete-event simulation models. These models mimic the operation of c...
Herbert D. Schwetman
COMPLEXITY
2007
94views more  COMPLEXITY 2007»
15 years 4 months ago
Emergence is coupled to scope, not level
Since its application to systems, emergence has been explained in terms of levels of observation. This approach has led to confusion, contradiction, incoherence and at times mysti...
Alex J. Ryan
IPM
2006
94views more  IPM 2006»
15 years 4 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
JMLR
2010
152views more  JMLR 2010»
14 years 11 months ago
Stochastic Composite Likelihood
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
Joshua V. Dillon, Guy Lebanon