Sciweavers

194 search results - page 25 / 39
» Computing Roundness is Easy if the Set is Almost Round
Sort
View
HPDC
2005
IEEE
14 years 1 months ago
Adaptive data block scheduling for parallel TCP streams
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. W...
Thomas J. Hacker, Brian D. Noble, Brian D. Athey
ICDCS
2010
IEEE
13 years 7 months ago
3DLoc: Three Dimensional Wireless Localization Toolkit
In this paper, we present 3DLoc: an integrated system of hardware and software toolkits for locating an 802.11compliant mobile device in a three dimensional (3D) space. 3DLoc feat...
Jizhi Wang, Yinjie Chen, Xinwen Fu, Jie Wang, Wei ...
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
12 years 11 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
LPNMR
1997
Springer
13 years 11 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 29 days ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...