Sciweavers

10392 search results - page 1927 / 2079
» Introduction to Computer Science
Sort
View
142
Voted
MOBIHOC
2003
ACM
16 years 7 days ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
105
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ICS
2010
Tsinghua U.
15 years 10 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
109
Voted
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
15 years 10 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
100
Voted
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 10 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
« Prev « First page 1927 / 2079 Last » Next »