Well, this mouse actually has the feedback - it has a built-in speaker so you can 'hear the wheel scrolling' when using the panel.
BTW - it's not a new device, my friend got it for the last Christmas.
To me, it would appear that an easier solution might be to use GIS data in combination with the cell phone signal and comparisons of rough morphological features of buildings.
For most people even photos aren't necessary. Using the data from nearest cells a mobile could be pinpointed within 100 m accuracy (in urban terrain, it degrades down do about 1000 m in rural terrain). It's enough if you are sent a map with the neighbourhood - the biggest problem then is the size of your mobile's screen.
Such services (sending a map of the neighbourhood, with interesting points, like ATMs, marked) already exist in Poland (Europe). I find them quite helpful.
Yes. But it still doesn't give quantum computer has any edge in searching databases - you may assume that they are always sorted.
Oh, BTW, if you don't care about inserting at all you may consider using perfect hashing functions. There are some theorems stating that if you have big enough universe (naming space) and small enough number of elements you may compute hashing function which is fast to compute (linear on input size) and gives no collisions.
But, as time to compute such hashing function may be expotential, it's practially useless.
Re:You are wrong - Re:Popular science
on
Molecular Photography
·
· Score: 2, Interesting
Either there is new Grover's algorithm or you misunderstood something.
The original Grover's algorithm is for searching in unsorted database. Grover has shown that this takes only O(sqrt(n)) steps as opposed to O(n) on classical computer.
Grover's algorithm does not deal with sorted or indexed databases and I don't think it can be adapted to make advantage of the order of database elements. What it does is simply taking advantage that you can quickly enhance the probability of choosing element matching your search criteria from all possible elements.
To summarize: as far as I know noone has shown deterministic nor quantum search in ordered set to be below O(log n) in worst case.
Slashdot Mirror
Well, he can complain to MS :)
Whether the complaint will be thrown to the garbage or positively processed is a different matter.
Well, this mouse actually has the feedback - it has a built-in speaker so you can 'hear the wheel scrolling' when using the panel. BTW - it's not a new device, my friend got it for the last Christmas.
To me, it would appear that an easier solution might be to use GIS data in combination with the cell phone signal and comparisons of rough morphological features of buildings.
For most people even photos aren't necessary. Using the data from nearest cells a mobile could be pinpointed within 100 m accuracy (in urban terrain, it degrades down do about 1000 m in rural terrain). It's enough if you are sent a map with the neighbourhood - the biggest problem then is the size of your mobile's screen.
Such services (sending a map of the neighbourhood, with interesting points, like ATMs, marked) already exist in Poland (Europe). I find them quite helpful.
Uh, oh, I've seen many dupes on Slashdot, but tripe?
A new era begins...
It may be good for motorists but it's very bad for humanity - the number of kidneys available as transplants will drop radically.
So, in the interest of humanity, ban those airbags now!
Yes. But it still doesn't give quantum computer has any edge in searching databases - you may assume that they are always sorted.
Oh, BTW, if you don't care about inserting at all you may consider using perfect hashing functions. There are some theorems stating that if you have big enough universe (naming space) and small enough number of elements you may compute hashing function which is fast to compute (linear on input size) and gives no collisions.
But, as time to compute such hashing function may be expotential, it's practially useless.
Either there is new Grover's algorithm or you misunderstood something.
The original Grover's algorithm is for searching in unsorted database. Grover has shown that this takes only O(sqrt(n)) steps as opposed to O(n) on classical computer.
Grover's algorithm does not deal with sorted or indexed databases and I don't think it can be adapted to make advantage of the order of database elements. What it does is simply taking advantage that you can quickly enhance the probability of choosing element matching your search criteria from all possible elements.
To summarize: as far as I know noone has shown deterministic nor quantum search in ordered set to be below O(log n) in worst case.
I believe they will go down.
Why? For sure they are based on this hyper-advanced alien technology they won't admit to?
So, if they manage to survive, we all will know.