3238 search results - page 53 / 648 » Not Enough Points Is Enough |
BMCBI
2011
12 years 11 months ago
2011
Background: Automatic quantification of neuronal morphology from images of fluorescence microscopy plays an increasingly important role in high-content screenings. However, there ...
STACS
2012
Springer
12 years 3 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
Constraint-based mining techniques on sequence databases have been studied extensively the last few years and efficient algorithms enable to compute complete collections of patte...
ECOOPW
1999
Springer
14 years 15 hour ago
1999
Springer
Moore’s Law is pushing us inevitably towards a world of pervasive, wireless, spontaneously networked computing devices. Whatever these devices do, they will have to talk to and n...
JGT
2007
13 years 7 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...