Sciweavers

5329 search results - page 924 / 1066
» The Weighted Majority Algorithm
Sort
View
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
13 years 11 months ago
CSTutor: a pen-based tutor for data structure visualization
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
Sarah Buchanan, Brandon Ochs, Joseph J. LaViola Jr...
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 6 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
13 years 6 months ago
Discovering Multiple Clustering Solutions: Grouping Objects in Different Views of the Data
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
Emmanuel Müller, Stephan Günnemann, Ines...
INFOCOM
2012
IEEE
13 years 6 months ago
Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks
—Data collection is one of the major traffic pattern in wireless sensor networks, which requires regular source nodes to send data packets to a common sink node with limited end...
Yongle Cao, Shuo Guo, Tian He
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 6 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...