Sciweavers

17329 search results - page 3111 / 3466
» Improved non-approximability results
Sort
View
SIGIR
2010
ACM
15 years 10 months ago
Studying trailfinding algorithms for enhanced web search
Search engines return ranked lists of Web pages in response to queries. These pages are starting points for post-query navigation, but may be insufficient for search tasks involvi...
Adish Singla, Ryen White, Jeff Huang
SIGIR
2010
ACM
15 years 10 months ago
Freshness matters: in flowers, food, and web authority
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...
Na Dai, Brian D. Davison
179
Voted
FOCS
2007
IEEE
15 years 10 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
SP
2010
IEEE
194views Security Privacy» more  SP 2010»
15 years 10 months ago
Identifying Dormant Functionality in Malware Programs
—To handle the growing flood of malware, security vendors and analysts rely on tools that automatically identify and analyze malicious code. Current systems for automated malwar...
Paolo Milani Comparetti, Guido Salvaneschi, Engin ...
GLOBECOM
2007
IEEE
15 years 10 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
« Prev « First page 3111 / 3466 Last » Next »