Sciweavers

427 search results - page 55 / 86
» Computing the Local Consensus of Trees
Sort
View
DCOSS
2010
Springer
15 years 9 months ago
MetroTrack: Predictive Tracking of Mobile Events Using Mobile Phones
We propose to use mobile phones carried by people in their everyday lives as mobile sensors to track mobile events. We argue that sensor-enabled mobile phones are best suited to de...
Gahng-Seop Ahn, Mirco Musolesi, Hong Lu, Reza Olfa...
ECAI
2004
Springer
15 years 10 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
AI
2000
Springer
15 years 4 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
WWW
2010
ACM
15 years 11 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...