Sciweavers

3946 search results - page 414 / 790
» The computational complexity of choice sets
Sort
View
ACMSE
2010
ACM
15 years 2 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
ICCV
2011
IEEE
14 years 7 months ago
Gaussian Process Regression Flow for Analysis of Motion Trajectories
Recognition of motions and activities of objects in videos requires effective representations for analysis and matching of motion trajectories. In this paper, we introduce a new r...
Kihwan Kim, Dongryeol Lee, Irfan Essa
ICALP
2009
Springer
16 years 8 months ago
External Sampling
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
CN
2008
98views more  CN 2008»
15 years 7 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
ICCV
2007
IEEE
16 years 9 months ago
Spatial Random Partition for Common Visual Pattern Discovery
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
Junsong Yuan, Ying Wu