Sciweavers

3628 search results - page 154 / 726
» The Decision Diffie-Hellman Problem
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
INFOCOM
2012
IEEE
13 years 8 months ago
Delay optimal multichannel opportunistic access
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
Shiyao Chen, Lang Tong, Qing Zhao
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
14 years 6 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
PAMI
2008
155views more  PAMI 2008»
15 years 5 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
15 years 12 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...