4972 search results - page 111 / 995 » Ranking on graph data |
130
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
The paper presents an algorithm to determine the close-tosmallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the...
130
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
135
Voted
IFL
1997
Springer
15 years 8 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
128
click to vote
SSDBM
2006
IEEE
15 years 10 months ago
2006
IEEE
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
179
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: The analysis of gene expression from time series underpins many biological studies. Two basic forms of analysis recur for data of this type: removing inactive (quiet) ...