Sciweavers

471 search results - page 66 / 95
» On the Relative Dominance of Paging Algorithms
Sort
View
PODC
2006
ACM
15 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
JCT
1998
193views more  JCT 1998»
14 years 9 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
SIGIR
2008
ACM
14 years 9 months ago
Towards breaking the quality curse.: a web-querying approach to web people search
Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned webpages often contain ...
Dmitri V. Kalashnikov, Rabia Nuray-Turan, Sharad M...
CIKM
2009
Springer
15 years 4 months ago
Personalized social search based on the user's social network
This work investigates personalized social search based on the user’s social relations – search results are re-ranked according to their relations with individuals in the user...
David Carmel, Naama Zwerdling, Ido Guy, Shila Ofek...
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 2 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...