Sciweavers

1897 search results - page 156 / 380
» Sparse Additive Machine
Sort
View
96
Voted
CEC
2003
IEEE
15 years 6 months ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds
119
Voted
JAVA
2001
Springer
15 years 5 months ago
Supporting dynamic parallel object arrays
We present efficient support for generalized arrays of parallel data driven objects. Array elements are regular C++ objects, and are scattered across the parallel machine. An indi...
Orion Sky Lawlor, Laxmikant V. Kalé
114
Voted
IEEEPACT
1999
IEEE
15 years 5 months ago
Memory System Support for Image Processing
Image processing applications tend to access their data non-sequentially and reuse that data infrequently. As a result, they tend to perform poorly on conventional memory systems ...
Lixin Zhang, John B. Carter, Wilson C. Hsieh, Sall...
97
Voted
LREC
2010
120views Education» more  LREC 2010»
15 years 2 months ago
Influence of Module Order on Rule-Based De-identification of Personal Names in Electronic Patient Records Written in Swedish
Electronic patient records (EPRs) are a valuable resource for research but for confidentiality reasons they cannot be used freely. In order to make EPRs available to a wider group...
Elin Carlsson, Hercules Dalianis
NIPS
2008
15 years 2 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie