Sciweavers

19700 search results - page 3744 / 3940
» DNA-Based Computation Times
Sort
View
122
Voted
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 3 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
139
Voted
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 3 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
DEDS
2008
87views more  DEDS 2008»
15 years 3 months ago
On-Line Monitoring of Large Petri Net Models Under Partial Observation
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
George Jiroveanu, René K. Boel, Behzad Bord...
126
Voted
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 3 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
152
Voted
ALMOB
2006
89views more  ALMOB 2006»
15 years 3 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
« Prev « First page 3744 / 3940 Last » Next »