Sciweavers

1511 search results - page 238 / 303
» Randomness, lowness and degrees
Sort
View
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 4 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
ECCV
2010
Springer
15 years 3 months ago
Exploiting Repetitive Object Patterns for Model Compression and Completion
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...
ICDCS
2010
IEEE
15 years 3 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
WCNC
2010
IEEE
15 years 3 months ago
MUTON: Detecting Malicious Nodes in Disruption-Tolerant Networks
—The Disruption Tolerant Networks (DTNs) are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary modifies the delivery metrics of the ...
Yanzhi Ren, Mooi Choo Chuah, Jie Yang, Yingying Ch...
GLOBECOM
2009
IEEE
15 years 3 months ago
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints
An important performance measure in wireless networks is the manner in which the network can distributively manage its limited energy and spectrum resources, while assuring certain...
Stepán Kucera, Ludek Kucera, Bing Zhang