Sciweavers

1435 search results - page 195 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
SENSYS
2009
ACM
15 years 9 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
WACV
2005
IEEE
15 years 8 months ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
140
Voted
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 7 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
CORR
2004
Springer
142views Education» more  CORR 2004»
15 years 2 months ago
Dynamic Localization Protocols for Mobile Sensor Networks
The ability of a sensor node to determine its physical location within a network (Localization) is of fundamental importance in sensor networks. Interpretating data from sensors i...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...
100
Voted
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 7 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