Sciweavers

2957 search results - page 586 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
JASIS
2010
141views more  JASIS 2010»
13 years 6 months ago
Member activities and quality of tags in a collection of historical photographs in Flickr
There is growing interest in, and an increasing number of attempts by, traditional information providers to engage social content creation and sharing communities in creating and ...
Besiki Stvilia, Corinne Jörgensen
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 6 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
KI
2010
Springer
13 years 6 months ago
Spatial Cognition: Reasoning, Action, Interaction
ut spatial environments, be it real or abstract, human or machine. Research issues range from human spatial cognition to mobile robot navigation. Numerous results have been obtaine...
Christian Freksa, Holger Schultheis, Kerstin Schil...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 5 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ASIACRYPT
2010
Springer
13 years 5 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert