2200 search results - page 189 / 440 » Bloch's Constant is Computable |
167
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
172
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
144
click to vote
PERCOM
2003
ACM
16 years 6 months ago
2003
ACM
This paper presents the "Solar" system framework that allows resources to advertise context-sensitive names and for applications to make context-sensitive name queries. ...
202
click to vote
EWSN
2004
Springer
16 years 6 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
387
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We introduce a morphological approach to curve evolution. The
differential operators used in the standard PDE snake models can be
approached using morphological operations...