3875 search results - page 641 / 775 » Approximation algorithms for the 0-extension problem |
134
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
139
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Many websites provide restrictive form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we consider the problem of es...
133
click to vote
CGF
2008
15 years 4 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
116
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
119
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...