2924 search results - page 432 / 585 » Lower Bounds in Distributed Computing |
189
click to vote
TSMC
2010
14 years 11 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
150
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
140
click to vote
STOC
1998
ACM
15 years 9 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
124
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
Enabling circuit switching in multiprocessor systems has the potential to achieve more efficient communication with lower cost compared to packet/wormhole switching. However, in ...
132
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In IEEE 802.11 based ad hoc networks, by simply manipulating the back-off timers and/or wait times prior to transmission, malicious nodes can cause a drastically reduced allocatio...