406 search results - page 39 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
ISMAR
2005
IEEE
15 years 5 months ago
2005
IEEE
In our poster presentation at ISMAR’04 [11], we proposed the idea of an AR training solution including capture and 3D replays of subtle movements. The crucial part missing for r...
ICDAR
2009
IEEE
15 years 6 months ago
2009
IEEE
Writer independent handwriting recognition systems are limited in their accuracy, primarily due the large variations in writing styles of most characters. Samples from a single ch...
104
click to vote
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
CHI
2005
ACM
16 years 6 days ago
2005
ACM
Rapid growth in the scientific literature makes it increasingly difficult for scientists to keep abreast of findings outside their own narrowing fields of expertise. To help biome...
ICCS
2003
Springer
15 years 5 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...