Sciweavers

438 search results - page 37 / 88
» The forest hiding problem
Sort
View
MCS
2009
Springer
15 years 4 months ago
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
Amir Ahmad, Gavin Brown
CORR
2007
Springer
131views Education» more  CORR 2007»
14 years 11 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
APAL
2008
104views more  APAL 2008»
14 years 12 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
ICIP
1999
IEEE
16 years 1 months ago
Data Embedding in Text for a Copier System
In this paper, we present a scheme for embedding data in copies (color or monochrome) of predominantly text pages that may also contain color images or graphics. Embedding data im...
Anoop K. Bhattacharjya, Hakan Ancin
P2P
2006
IEEE
121views Communications» more  P2P 2006»
15 years 5 months ago
The Orchard Algorithm: P2P Multicasting without Free-Riding
The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g.,...
Jan-David Mol, Dick H. J. Epema, Henk J. Sips