Sciweavers

209 search results - page 36 / 42
» t-Spanners for metric space searching
Sort
View
LOGCOM
2011
13 years 20 days ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
DATAMINE
2006
224views more  DATAMINE 2006»
13 years 9 months ago
Characteristic-Based Clustering for Time Series Data
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is cr...
Xiaozhe Wang, Kate A. Smith, Rob J. Hyndman
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
14 years 10 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
CVPR
2009
IEEE
15 years 4 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...