843 search results - page 68 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
146
Voted
WSC
2008
15 years 3 months ago
2008
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
189
click to vote
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
116
click to vote
SSDBM
2003
IEEE
15 years 6 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
SIGCOMM
1999
ACM
15 years 5 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
177
click to vote
CORR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...