Sciweavers

1265 search results - page 93 / 253
» Finding the Key to a Synapse
Sort
View
JUCS
2008
123views more  JUCS 2008»
13 years 9 months ago
Exploring Information Extraction Resilience
: There are many challenges developers face when attempting to reliably extract data from the Web. One of these challenges is the resilience of the extraction system to changes in ...
Dawn G. Gregg
MOR
2008
110views more  MOR 2008»
13 years 9 months ago
Alternating Projections on Manifolds
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...
Adrian S. Lewis, Jérôme Malick
MP
2008
103views more  MP 2008»
13 years 9 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
NETWORKS
2008
13 years 9 months ago
The number of spanning trees in a class of double fixed-step loop networks
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
Xuerong Yong, Yuanping Zhang, Mordecai J. Golin
MP
2006
80views more  MP 2006»
13 years 9 months ago
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
Jiawang Nie, James Demmel, Bernd Sturmfels