Sciweavers

19320 search results - page 3711 / 3864
» On the complexity of computing determinants
Sort
View
PAMI
2002
122views more  PAMI 2002»
14 years 9 months ago
Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
Ravi Ramamoorthi
SAC
2002
ACM
14 years 9 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...
TCS
1998
14 years 9 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
TKDE
1998
139views more  TKDE 1998»
14 years 9 months ago
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency an...
Alexander Thomasian
TVCG
1998
127views more  TVCG 1998»
14 years 9 months ago
Dynamic Catmull-Clark Subdivision Surfaces
—Recursive subdivision schemes have been extensively used in computer graphics, computer-aided geometric design, and scientific visualization for modeling smooth surfaces of arbi...
Hong Qin, Chhandomay Mandal, Baba C. Vemuri
« Prev « First page 3711 / 3864 Last » Next »