9997 search results - page 413 / 2000 » The case for crowd computing |
173
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
155
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
198
click to vote
CONCURRENCY
2002
15 years 6 months ago
2002
In this paper, we outline the design of a recommendation system (MyPYTHIA) implemented as a web portal. MyPYTHIA's design objectives include evaluating the quality and perfor...
231
click to vote
TCS
2011
15 years 1 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
151
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
We present several methods for the estimation of relative pose between planes and cameras, based on projections of sets of coplanar features in images. While such methods exist fo...