Sciweavers

7228 search results - page 48 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
15 years 10 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
ICMLA
2008
14 years 11 months ago
Highly Scalable SVM Modeling with Random Granulation for Spam Sender Detection
Spam sender detection based on email subject data is a complex large-scale text mining task. The dataset consists of email subject lines and the corresponding IP address of the em...
Yuchun Tang, Yuanchen He, Sven Krasser
BIRTHDAY
2003
Springer
15 years 3 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
15 years 4 months ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...