562 search results - page 52 / 113 » Ordered Sets in the Calculus of Data Structures |
130
click to vote
WAW
2010
Springer
14 years 9 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
CORR
1999
Springer
14 years 11 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
103
click to vote
DKE
2006
14 years 12 months ago
2006
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
101
click to vote
BIOINFORMATICS
2011
14 years 3 months ago
2011
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Many applications of spoken-language systems can benefit from having access to annotations of prosodic events. Unfortunately, obtaining human annotations of these events, even se...