Sciweavers

17505 search results - page 3464 / 3501
» Use Cases as Workflows
Sort
View
167
Voted
PAMI
1998
116views more  PAMI 1998»
15 years 3 months ago
Scale-Space Derived From B-Splines
—It is well-known that the linear scale-space theory in computer vision is mainly based on the Gaussian kernel. The purpose of the paper is to propose a scale-space theory based ...
Yu-Ping Wang, Seng Luan Lee
147
Voted
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 3 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
155
Voted
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
15 years 3 months ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang
145
Voted
SAC
2002
ACM
15 years 3 months ago
Semi-automatic design of agent organisations
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
Anthony Karageorgos, Simon G. Thompson, Nikolay Me...
122
Voted
SIAMCO
2002
71views more  SIAMCO 2002»
15 years 3 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
« Prev « First page 3464 / 3501 Last » Next »