5316 search results - page 271 / 1064 » Which Search Problems Are Random |
129
click to vote
ICMLA
2007
15 years 6 months ago
2007
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
137
Voted
AUTOMATICA
2010
15 years 5 months ago
2010
A recent lifting technique led to a computationally efficient Model Predictive Control (MPC) strategy in which the online optimization is performed using a univariate Newton-Raphs...
124
click to vote
NPL
2000
15 years 4 months ago
2000
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
142
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
152
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...