Sciweavers

1279 search results - page 237 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
EOR
2010
88views more  EOR 2010»
14 years 11 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
16 years 2 days ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...
MOBIHOC
2008
ACM
15 years 11 months ago
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
Karthikeyan Sundaresan, Sampath Rangarajan
MOBIHOC
2008
ACM
15 years 11 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
CIKM
2008
Springer
15 years 1 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand