1984 search results - page 43 / 397 » The colourful feasibility problem |
DFT
2006
IEEE
14 years 4 months ago
2006
IEEE
Continued increase in complexity of digital image sensors means that defects are more likely to develop in the field, but little concrete information is available on in-field defe...
SCP
2011
13 years 4 months ago
2011
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
CP
2006
Springer
14 years 1 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
DATAMINE
2007
13 years 10 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
ACL
2012
12 years 10 days ago
2012
In this paper we introduce the novel task of “word epoch disambiguation,” defined as the problem of identifying changes in word usage over time. Through experiments run using...