Sciweavers

1451 search results - page 287 / 291
» Order independence and rationalizability
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
IJET
2007
121views more  IJET 2007»
13 years 7 months ago
A Technology Based Program That Matches Enrichment Resources With Student Strengths
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
Joseph S. Renzulli, Sally M. Reis
SIGOPS
2008
119views more  SIGOPS 2008»
13 years 7 months ago
Project Kittyhawk: building a global-scale computer: Blue Gene/P as a generic computing platform
This paper describes Project Kittyhawk, an undertaking at IBM Research to explore the construction of a nextgeneration platform capable of hosting many simultaneous web-scale work...
Jonathan Appavoo, Volkmar Uhlig, Amos Waterland
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
BMCBI
2005
85views more  BMCBI 2005»
13 years 7 months ago
Prediction of twin-arginine signal peptides
Background: Proteins carrying twin-arginine (Tat) signal peptides are exported into the periplasmic compartment or extracellular environment independently of the classical Secdepe...
Jannick Dyrløv Bendtsen, Henrik Nielsen, Da...