4103 search results - page 150 / 821 » Some results on the Collatz problem |
194
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
This paper addresses the problem of efficiently solving large-scale energy minimization problems encountered in computer vision. We propose an energy-aware method for merging ran...
166
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
191
click to vote
WINE
2007
Springer
16 years 22 days ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
187
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
183
click to vote
ICDM
2006
IEEE
16 years 20 days ago
2006
IEEE
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...