Sciweavers

11949 search results - page 292 / 2390
» Some results on (a:b)-choosability
Sort
View
WWW
2007
ACM
16 years 2 months ago
Identifying ambiguous queries in web search
It is widely believed that some queries submitted to search engines are by nature ambiguous (e.g., java, apple). However, few studies have investigated the questions of "how ...
Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, H...
112
Voted
WWW
2005
ACM
16 years 2 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 2 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
CHI
2008
ACM
16 years 2 months ago
Feasibility and pragmatics of classifying working memory load with an electroencephalograph
A reliable and unobtrusive measurement of working memory load could be used to evaluate the efficacy of interfaces and to provide real-time user-state information to adaptive syst...
David B. Grimes, Desney S. Tan, Scott E. Hudson, P...
VLSID
2002
IEEE
115views VLSI» more  VLSID 2002»
16 years 2 months ago
Logic Synthesis for AND-XOR-OR Type Sense-Amplifying PLA
In this paper, a new logic synthesis method for an AND-XOR-OR type sense-amplifying PLA is proposed. An AND-XOR-OR type sense-amplifying PLA can achieve lowpower dissipation and h...
Hiroaki Yoshida, Hiroaki Yamaoka, Makoto Ikeda, Ku...