1888 search results - page 273 / 378 » Proof theory and computational analysis |
168
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
162
click to vote
CHI
2009
ACM
16 years 6 months ago
2009
ACM
Contemporary work increasingly involves interacting with strangers in technology-mediated environments. In this context, we come to rely on digital artifacts to infer characterist...
173
click to vote
PLDI
2009
ACM
16 years 24 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
195
click to vote
MMB
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
198
click to vote
CIVR
2007
Springer
16 years 5 days ago
2007
Springer
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...