11212 search results - page 27 / 2243 » Semi-persistent Data Structures |
NAACL
2001
13 years 9 months ago
2001
We present two methods for learning the structure of personal names from unlabeled data. The first simply uses a few implicit constraints governing this structure to gain a toehol...
IJCAI
2007
13 years 9 months ago
2007
Recently, generative probabilistic modeling principles were extended to visualization of structured data types, such as sequences. The models are formulated as constrained mixture...
PPOPP
2012
ACM
12 years 3 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
ECBS
2010
IEEE
13 years 5 months ago
2010
IEEE
In classical data warehouses (DWH), classification of values takes place in a sharp manner, because of this true values cannot be measured and smooth transition between classes do...
JOSS
2000
13 years 7 months ago
2000
: Data structures comprising many binary variables can be represented graphically in various ways. Depending on the purpose different plots might be useful. Here two ways of showin...