1568 search results - page 202 / 314 » The problem of examination questions in algorithmics |
192
click to vote
PR
2011
14 years 9 months ago
2011
Increasingly large amount of multidimensional data are being generated on a daily basis in many applications. This leads to a strong demand for learning algorithms to extract usef...
189
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Drawing a box around an intended segmentation target has become both a popular user interface and a common output for learning-driven detection algorithms. Despite the ubiquity of...
162
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
163
click to vote
FOCS
2006
IEEE
16 years 14 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
136
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...