Sciweavers

12519 search results - page 2135 / 2504
» Approximation Problems Categories
Sort
View
CCS
2011
ACM
14 years 6 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
CCS
2011
ACM
14 years 6 months ago
The power of procrastination: detection and mitigation of execution-stalling malicious code
Malware continues to remain one of the most important security problems on the Internet today. Whenever an anti-malware solution becomes popular, malware authors typically react p...
Clemens Kolbitsch, Engin Kirda, Christopher Kruege...
CIKM
2011
Springer
14 years 6 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
CIKM
2011
Springer
14 years 6 months ago
Content-driven detection of campaigns in social media
We study the problem of detecting coordinated free text campaigns in large-scale social media. These campaigns – ranging from coordinated spam messages to promotional and advert...
Kyumin Lee, James Caverlee, Zhiyuan Cheng, Daniel ...
CIKM
2011
Springer
14 years 6 months ago
Coreference aware web object retrieval
As user demands become increasingly sophisticated, search engines today are competing in more than just returning document results from the Web. One area of competition is providi...
Jeffrey Dalton, Roi Blanco, Peter Mika
« Prev « First page 2135 / 2504 Last » Next »