Sciweavers

12257 search results - page 2246 / 2452
» Analysis of Algorithms
Sort
View
143
Voted
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 7 months ago
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Foster J. Provost, Gary M. Weiss
131
Voted
JUCS
2008
130views more  JUCS 2008»
15 years 3 months ago
Feature Selection for the Classification of Large Document Collections
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...
141
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
15 years 10 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
130
Voted
IPSN
2004
Springer
15 years 9 months ago
Nonparametric belief propagation for self-calibration in sensor networks
Automatic self-calibration of ad-hoc sensor networks is a critical need for their use in military or civilian applications. In general, self-calibration involves the combination o...
Alexander T. Ihler, John W. Fisher III, Randolph L...
« Prev « First page 2246 / 2452 Last » Next »