Sciweavers

1690 search results - page 187 / 338
» Serial experiments online
Sort
View
PAKDD
2010
ACM
189views Data Mining» more  PAKDD 2010»
15 years 9 months ago
Subsequence Matching of Stream Synopses under the Time Warping Distance
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen
CSE
2009
IEEE
15 years 9 months ago
metaViz: Visualizing Computationally Identified Metaphors in Political Blogs
This paper presents metaViz, an online application that uses computational metaphor identification to find conceptual metaphors in political blogs. The application presents those ...
Eric P. S. Baumer, Jordan Sinclair, David Hubin, B...
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
15 years 9 months ago
Clustering with Lower Bound on Similarity
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...
OHS
2001
Springer
15 years 9 months ago
Developing Adaptive Internet Based Courses with the Authoring System NetCoach
Developing adaptive internet based learning courses usually requires a lot of programming efforts to provide session management, keeping track of the learners current state, and ad...
Gerhard Weber, Hans-Christian Kuhl, Stephan Weibel...
131
Voted
ICRA
2000
IEEE
111views Robotics» more  ICRA 2000»
15 years 9 months ago
Learning Globally Consistent Maps by Relaxation
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro