Sciweavers

2515 search results - page 492 / 503
» Interval Availability Distribution Computation
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 8 days ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 2 days ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 2 days ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
EWSN
2004
Springer
15 years 11 months ago
Structured Communication in Single Hop Sensor Networks
Abstract. We propose a model for communication in single-hop wireless sensor networks and define and evaluate the performance of a robust, energy balanced protocol for a powerful a...
Amol Bakshi, Viktor K. Prasanna
SOSP
2003
ACM
15 years 8 months ago
Xen and the art of virtualization
Numerous systems have been designed which use virtualization to subdivide the ample resources of a modern computer. Some require specialized hardware, or cannot support commodity ...
Paul Barham, Boris Dragovic, Keir Fraser, Steven H...