817 search results - page 10 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
ICASSP
2011
IEEE
13 years 9 days ago
2011
IEEE
In this paper we present a algorithm designed to detect and characterise the signal coming from Frequency Modulation Continuous Wave radars. The signals are made of linear frequen...
STOC
1996
ACM
14 years 22 days ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
IJCNLP
2005
Springer
14 years 2 months ago
2005
Springer
Research on linear text segmentation has been an on-going focus in NLP for the last decade, and it has great potential for a wide range of applications such as document summarizati...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
SIROCCO
1998
13 years 10 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...