Sciweavers

2612 search results - page 123 / 523
» Switching Graphs and Their Complexity
Sort
View
MMM
1998
Springer
296views Multimedia» more  MMM 1998»
15 years 8 months ago
Interaction with a Projection Screen Using a Camera-tracked Laser Pointer
A system for direct interaction with a video projection screen using a laser pointer is presented. The laser point on the screen is captured by a video camera, and its location re...
Carsten Kirstein, Heinrich Müller
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 6 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
15 years 8 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
VVS
1998
IEEE
106views Visualization» more  VVS 1998»
15 years 8 months ago
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
Cláudio T. Silva, Joseph S. B. Mitchell, Pe...
IJAC
2007
116views more  IJAC 2007»
15 years 4 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil