Sciweavers

372 search results - page 46 / 75
» The box mover problem
Sort
View
ICDAR
2003
IEEE
14 years 3 months ago
On-line Overlaid-Handwriting Recognition Based on Substroke HMMs
This paper proposes a novel handwriting recognition interface for wearable computing where users write characters continuously without pauses on a small single writing box. Since ...
Hiroshi Shimodaira, Takashi Sudo, Mitsuru Nakai, S...
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 8 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi
TAMC
2007
Springer
14 years 3 months ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
14 years 3 months ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho