Sciweavers

1254 search results - page 62 / 251
» Making Hard Problems Harder
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
SIGSOFT
2007
ACM
14 years 8 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
CVPR
2008
IEEE
14 years 9 months ago
A discriminatively trained, multiscale, deformable part model
This paper describes a discriminatively trained, multiscale, deformable part model for object detection. Our system achieves a two-fold improvement in average precision over the b...
Pedro F. Felzenszwalb, David A. McAllester, Deva R...
ICDCS
2009
IEEE
14 years 4 months ago
FlashLite: A User-Level Library to Enhance Durability of SSD for P2P File Sharing
Peer-to-peer file sharing is popular, but it generates random write traffic to storage due to the nature of swarming. NAND flash memory based Solid-State Drive (SSD) technology...
Hyojun Kim, Umakishore Ramachandran
ACSC
2006
IEEE
14 years 1 months ago
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
Anirban Majumdar, Clark D. Thomborson