727 search results - page 112 / 146 » One line and n points |
169
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
197
click to vote
SIAMREV
2010
15 years 24 days ago
2010
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...
138
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Each clustering algorithm induces a similarity between given data points, according to the underlying clustering criteria. Given the large number of available clustering technique...
124
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
163
click to vote
MFCS
2009
Springer
16 years 19 days ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...