Sciweavers

3466 search results - page 580 / 694
» Fast computation of special resultants
Sort
View
SAC
2009
ACM
16 years 1 months ago
Impact of NVRAM write cache for file system metadata on I/O performance in embedded systems
File systems make use of part of DRAM as the buffer cache to enhance its performance in traditional systems. In this paper, we consider the use of Non-Volatile RAM (NVRAM) as a w...
In Hwan Doh, Hyo J. Lee, Young Je Moon, Eunsam Kim...
SAC
2009
ACM
16 years 1 months ago
ERIKA and open-ZB: an implementation for real-time wireless networking
IEEE 802.15.4/ZigBee and TinyOS have been playing an important role in leveraging a new generation of large-scale networked embedded systems. However, based on previous experience...
Paolo Pagano, Mangesh Chitnis, Antonio Romano, Giu...
COLT
1993
Springer
15 years 10 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
ATAL
2010
Springer
15 years 7 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
CIKM
2006
Springer
15 years 8 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu