681 search results - page 110 / 137 » General Polynomial Time Decomposition Algorithms |
125
click to vote
KDD
2008
ACM
16 years 25 days ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
147
Voted
TASE
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
120
Voted
BMCBI
2007
15 years 16 days ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
106
Voted
SENSYS
2005
ACM
15 years 6 months ago
2005
ACM
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
110
click to vote
SIROCCO
2004
15 years 1 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...