61 search results - page 9 / 13 » Using Elimination Theory to construct Rigid Matrices |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—Inspired by the recent development of optical queueing theory, in this paper we study a class of multistage interconnection networks (MINs), called twister networks. Unl...
CONEXT
2010
ACM
13 years 5 months ago
2010
ACM
Fundamental limitations of traditional data center network architectures have led to the development of architectures that provide enormous bisection bandwidth for up to hundreds ...
SIAMAM
2011
13 years 2 months ago
2011
We consider the problem of locating perfectly conducting cracks and estimating their geometric features from multi-static response matrix measurements at a single or multiple frequ...
JCIT
2008
13 years 7 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...