539 search results - page 43 / 108 » Recurrence relations and fast algorithms |
107
Voted
EDBT
2006
ACM
16 years 17 days ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
105
click to vote
CNSR
2004
IEEE
15 years 4 months ago
2004
IEEE
In order to control and manage highly aggregated Internet traffic flows efficiently, we need to be able to categorize flows into distinct classes and to be knowledgeable about the...
112
click to vote
BMCBI
2010
15 years 17 days ago
2010
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
122
Voted
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
ISPASS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system ...