Sciweavers

620 search results - page 121 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
87
Voted
PASTE
2004
ACM
15 years 3 months ago
Mock object creation for test factoring
Test factoring creates fast, focused unit tests from slow systemwide tests; each new unit test exercises only a subset of the functionality exercised by the system tests. Augmenti...
David Saff, Michael D. Ernst
CCS
2004
ACM
15 years 2 months ago
Privacy and security in library RFID: issues, practices, and architectures
We expose privacy issues related to Radio Frequency Identification (RFID) in libraries, describe current deployments, and suggest novel architectures for library RFID. Libraries ...
David Molnar, David Wagner
CASES
2003
ACM
15 years 2 months ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua
78
Voted
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
SPAA
2010
ACM
15 years 2 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...