Sciweavers

6562 search results - page 373 / 1313
» Noetherianity and Combination Problems
Sort
View
WWW
2009
ACM
16 years 7 months ago
Discovering the staring people from social networks
In this paper, we study a novel problem of staring people discovery from social networks, which is concerned with finding people who are not only authoritative but also sociable i...
Dewei Chen, Jie Tang, Juanzi Li, Lizhu Zhou
CVPR
2010
IEEE
16 years 3 months ago
Tracking People Interacting with Objects
While the problem of tracking 3D human motion has been widely studied, most approaches have assumed that the person is isolated and not interacting with the environment. Environme...
Hedvig Kjellstrom, Michael Black, Danica Kragic
ISAAC
2009
Springer
116views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
Francisco Claude, Reza Dorrigiv, Stephane Durocher...
ISNN
2009
Springer
16 years 1 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
SAT
2009
Springer
91views Hardware» more  SAT 2009»
16 years 1 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith