Sciweavers

STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 4 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
SIGIR
1999
ACM
14 years 4 months ago
Efficient Distributed Algorithms to Build Inverted Files
We present three distributed algorithms to build global inverted files for very large text collections. The distributed environment we use is a high bandwidth network of workstati...
Berthier A. Ribeiro-Neto, Edleno Silva de Moura, M...
ITICSE
1999
ACM
14 years 4 months ago
Distributed algorithms visualisation for educational purposes
We present our work on building interactive continuous visualisations of distributed algorithms for educational purposes. The animations are comprised by a set of visualisation wi...
Boris Koldehofe, Marina Papatriantafilou, Philippa...
DIALM
1999
ACM
117views Algorithms» more  DIALM 1999»
14 years 4 months ago
Multi-fidelity algorithms for interactive mobile applications
Mahadev Satyanarayanan, Dushyanth Narayanan
DIALM
1999
ACM
113views Algorithms» more  DIALM 1999»
14 years 4 months ago
Flooding for reliable multicast in multi-hop ad hoc networks
Ad hoc networks are gaining popularity as a result of advances in smaller, more versatile and powerful mobile computing devices. The distinguishing feature of these networks is the...
Christopher Ho, Katia Obraczka, Gene Tsudik, Kumar...
DIALM
1999
ACM
127views Algorithms» more  DIALM 1999»
14 years 4 months ago
The performance of query control schemes for the zone routing protocol
—In this paper, we study the performance of route query control mechanisms for the Zone Routing Protocol (ZRP) for ad hoc networks. ZRP proactively maintains routing information ...
Zygmunt J. Haas, Marc R. Pearlman
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
14 years 4 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...
DIALM
1999
ACM
150views Algorithms» more  DIALM 1999»
14 years 4 months ago
Mobile computing in next generation wireless networks
In this paper, we attempt to describe the evolving status of wireless communications and its impact on the future of mobile computing. We present a historical perspective and eluc...
Prathima Agrawal, David Famolari
AAIM
2010
Springer
144views Algorithms» more  AAIM 2010»
14 years 4 months ago
Kernelization for Cycle Transversal Problems
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
Ge Xia, Yong Zhang