248 search results - page 16 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— We introduce spectral shaping of timing mismatches in time-interleaved analog-to-digital converters (TIADCs). We show how to reorder the channel ADC sequence in order to achiev...
COCOON
2001
Springer
14 years 6 days ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...