534 search results - page 23 / 107 » Tight approximation algorithm for connectivity augmentation ... |
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
JECR
2002
13 years 7 months ago
2002
Extended enterprises are networks of organizations interconnected to exchange critical resources, such as raw materials, labor, access to markets, specialized skills and knowledge...
ESANN
2000
13 years 9 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...