Sciweavers

29908 search results - page 5890 / 5982
» On the complexity of communication complexity
Sort
View
JZUSC
2010
129views more  JZUSC 2010»
13 years 8 months ago
Representing conics by low degree rational DP curves
: A DP curve is a new kind of parametric curve defined by Delgado and Peña (2003); it has very good properties when used in both geometry and algebra, i.e., it is shape preserving...
Qian-qian Hu, Guo-jin Wang
KBSE
2010
IEEE
13 years 8 months ago
MODA: automated test generation for database applications via mock objects
Software testing has been commonly used in assuring the quality of database applications. It is often prohibitively expensive to manually write quality tests for complex database ...
Kunal Taneja, Yi Zhang, Tao Xie
KDD
2010
ACM
286views Data Mining» more  KDD 2010»
13 years 8 months ago
Nonnegative shared subspace learning and its application to social media retrieval
Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can ser...
Sunil Kumar Gupta, Dinh Q. Phung, Brett Adams, Tru...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 8 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
LATIN
2010
Springer
13 years 8 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
« Prev « First page 5890 / 5982 Last » Next »