Sciweavers

906 search results - page 110 / 182
» Linking Theories of Concurrency
Sort
View
ADCS
2004
14 years 11 months ago
Focused Crawling in Depression Portal Search: A Feasibility Study
Previous work on domain specific search services in the area of depressive illness has documented the significant human cost required to setup and maintain closed-crawl parameters....
Thanh Tin Tang, David Hawking, Nick Craswell, Rame...
FTCS
1997
115views more  FTCS 1997»
14 years 11 months ago
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts
This paper presents robust emulation of multi-writer/multi-reader registers in message-passing systems using dynamic quorum con gurations. In addition to processor and link failur...
Nancy A. Lynch, Alexander A. Shvartsman
CORR
2007
Springer
151views Education» more  CORR 2007»
14 years 9 months ago
Distributed spatial multiplexing with 1-bit feedback
— We analyze the feasibility of distributed spatial multiplexing with limited feedback in a slow-fading interference network with MN non-cooperating single-antenna sources and M ...
J. Thukral, Helmut Bölcskei
INFOCOM
2012
IEEE
13 years 7 days ago
Squeezing the most out of interference: An optimization framework for joint interference exploitation and avoidance
—There is a growing interest in exploiting interference (rather than avoiding it) to increase network throughput. In particular, the so-called successive interference cancellatio...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou,...
WWW
2006
ACM
15 years 10 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang