Sciweavers

3378 search results - page 570 / 676
» A universe of binding and computation
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CPHYSICS
2006
85views more  CPHYSICS 2006»
15 years 6 months ago
Simulation of n-qubit quantum systems. II. Separability and entanglement
Studies on the entanglement of n-qubit quantum systems have attracted a lot of interest during recent years. Despite the central role of entanglement in quantum information theory...
T. Radtke, S. Fritzsche
COMPUTER
2007
135views more  COMPUTER 2007»
15 years 6 months ago
A Language for Human Action
and therefore should be implemented outside the sensory-motor system. This way, meaning for a concept amounts to the content of a symbolic expression, a definition of the concept ...
Gutemberg Guerra-Filho, Yiannis Aloimonos
SWAT
1998
Springer
110views Algorithms» more  SWAT 1998»
15 years 10 months ago
On the Number of Regular Vertices of the Union of Jordan Regions
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
CVPR
2009
IEEE
1289views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Bundling Features for Large Scale Partial-Duplicate Web Image Search
In state-of-the-art image retrieval systems, an image is represented by a bag of visual words obtained by quantizing high-dimensional local image descriptors, and scalable schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...