Sciweavers

3206 search results - page 538 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 6 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...
SIGIR
2009
ACM
14 years 3 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
SIGIR
2009
ACM
14 years 3 months ago
Building enriched document representations using aggregated anchor text
It is well known that anchor text plays a critical role in a variety of search tasks performed over hypertextual domains, including enterprise search, wiki search, and web search....
Donald Metzler, Jasmine Novak, Hang Cui, Srihari R...
MSWIM
2003
ACM
14 years 2 months ago
Simulation of large ad hoc networks
An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad ho...
Valeriy Naoumov, Thomas R. Gross
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
14 years 24 days ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir