691 search results - page 58 / 139 » Using Classifiers to Solve Warehouse Location Problems |
119
Voted
SODA
1990
ACM
15 years 4 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
136
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
130
click to vote
NIPS
2008
15 years 4 months ago
2008
One of the original goals of computer vision was to fully understand a natural scene. This requires solving several sub-problems simultaneously, including object detection, region...
145
click to vote
CORR
2010
Springer
15 years 9 days ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
122
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...