Sciweavers

8196 search results - page 184 / 1640
» Computational Modeling and Complexity Science
Sort
View
ANSS
2006
IEEE
16 years 16 days ago
A New Approach for Computing Conditional Probabilities of General Stochastic Processes
In this paper Hidden Markov Model algorithms are considered as a method for computing conditional properties of continuous-time stochastic simulation models. The goal is to develo...
Fabian Wickborn, Claudia Isensee, Thomas Simon, Sa...
CVPR
2003
IEEE
16 years 8 months ago
Recognising and Monitoring High-Level Behaviours in Complex Spatial Environments
The recognition of activities from sensory data is important in advanced surveillance systems to enable prediction of high-level goals and intentions of the target under surveilla...
Nam Thanh Nguyen, Hung Hai Bui, Svetha Venkatesh, ...
HUMAN
2003
Springer
15 years 11 months ago
A Framework of Winner Determination Algorithms for Internet Auctions
Auctions have become popular in conducting trade negotiations on the Internet. The design of new auction formats and other negotiation protocols has become an important topic for r...
Juhnyoung Lee, Sang-goo Lee, Suekyung Lee
ECCV
1996
Springer
16 years 8 months ago
Learning Dynamics of Complex Motions from Image Sequences
In Proc. European Conf. Computer Vision, 1996, pp. 357{368, Cambridge, UK The performance of Active Contours in tracking is highly dependent on the availability of an appropriate ...
David Reynard, Andrew Wildenberg, Andrew Blake, Jo...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang