Sciweavers

2657 search results - page 202 / 532
» On the complexity of hierarchical problem solving
Sort
View
WWW
2005
ACM
16 years 7 months ago
An experimental study on large-scale web categorization
Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification tech...
Tie-Yan Liu, Yiming Yang, Hao Wan, Qian Zhou, Bin ...
MSV
2007
15 years 8 months ago
FMC-QE: A New Approach in Quantitative Modeling
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
Werner Zorn
NIPS
2003
15 years 8 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
CVGIP
2007
88views more  CVGIP 2007»
15 years 6 months ago
Autonomous pedestrians
We address the difficult open problem of emulating the rich complexity of real pedestrians in urban environments. Our artificial life approach integrates motor, perceptual, beha...
Wei Shao, Demetri Terzopoulos
IPPS
2006
IEEE
16 years 20 days ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch