Sciweavers

2925 search results - page 485 / 585
» Information Complexity of Online Problems
Sort
View
GRC
2010
IEEE
15 years 4 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
ISCI
2002
112views more  ISCI 2002»
15 years 3 months ago
Intelligent learning and control of autonomous robotic agents operating in unstructured environments
The control of autonomous intelligent robotic agent operating in unstructured changing environments includes many objective difficulties. One major difficulty concerns the charact...
Hani Hagras, Tarek M. Sobh
163
Voted
ECCV
2010
Springer
15 years 1 months ago
Discriminative Nonorthogonal Binary Subspace Tracking
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
Ang Li, Feng Tang, Yanwen Guo, Hai Tao
148
Voted
WWW
2006
ACM
16 years 4 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
CIKM
2009
Springer
15 years 10 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...