Sciweavers

2111 search results - page 76 / 423
» Understanding the Yarowsky Algorithm
Sort
View
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
CORR
2012
Springer
176views Education» more  CORR 2012»
13 years 5 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
TKDE
2012
212views Formal Methods» more  TKDE 2012»
13 years 6 days ago
Segmentation and Sampling of Moving Object Trajectories Based on Representativeness
—Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this pap...
Costas Panagiotakis, Nikos Pelekis, Ioannis Kopana...
AIED
2005
Springer
15 years 3 months ago
Educational Data Mining: a Case Study
In this paper, we show how using data mining algorithms can help discovering pedagogically relevant knowledge contained in databases obtained from Web-based educational systems. Th...
Agathe Merceron, Kalina Yacef
PPPJ
2004
ACM
15 years 3 months ago
Using the divide and conquer strategy to teach Java framework design
All programmers should understand the concept of program families and know the techniques for constructing them. This paper describes a case study that can be used to introduce st...
H. Conrad Cunningham, Yi Liu, Cuihua Zhang