Sciweavers

4013 search results - page 99 / 803
» computing 2002
Sort
View
DAM
2002
82views more  DAM 2002»
15 years 2 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
MOC
2002
121views more  MOC 2002»
15 years 2 months ago
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
Andreas Enge
100
Voted
ICDCSW
2002
IEEE
15 years 7 months ago
An Architecture Concept for Ubiquitous Computing Aware Wearable Computers
In Marc Weiser’s vision of ubiquitous computing, users are located in an environment with potentially thousands of computers around them. Many capabilities of these smart device...
Martin Bauer, Bernd Brügge, Gudrun Klinker, A...
ISWC
2002
IEEE
15 years 7 months ago
Mediated Reality Using Computer Graphics Hardware for Computer Vision
Wearable, camera based, head–tracking systems use spatial image registration algorithms to align images taken as the wearer gazes around their environment. This allows for compu...
James Fung, Felix Tang, Steve Mann