Sciweavers

529 search results - page 9 / 106
» C Essentials
Sort
View
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 7 months ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
Satyen Kale, C. Seshadhri
BC
1999
104views more  BC 1999»
13 years 7 months ago
Control of multistability in ring circuits of oscillators
The essential dynamics of some biological central pattern generators (CPGs) can be captured by a model consisting of x neurons connected in a ring. These circuits, like many oscill...
Carmen C. Canavier, Douglas A. Baxter, J. W. Clark...
SIGKDD
2002
78views more  SIGKDD 2002»
13 years 7 months ago
Predicting the Effects of Gene Deletion
In this paper, we describe techniques that can be used to predict the effects of gene deletion. We will focus mainly on the creation of predictive variables, and then briefly disc...
David S. Vogel, Randy C. Axelrod
SIAMDM
2010
110views more  SIAMDM 2010»
13 years 2 months ago
Embedding Spanning Trees in Random Graphs
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
Michael Krivelevich
IJUFKS
2010
77views more  IJUFKS 2010»
13 years 4 months ago
How to Handle Interval solutions for Cooperative Interval Games
Interval uncertainty affects our decision making activities on a daily basis making the data structure of intervals of real numbers more and more popular in theoretical models and...
Rodica Branzei, Stef Tijs, S. Z. Alparslan Gö...