3946 search results - page 627 / 790 » The computational complexity of choice sets |
191
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
190
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
170
click to vote
HPCA
2007
IEEE
16 years 7 months ago
2007
IEEE
The emergence of multicore architectures will lead to an increase in the use of multithreaded applications that are prone to synchronization bugs, such as data races. Software sol...
194
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
222
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...