Sciweavers

2588 search results - page 103 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
CVPR
1998
IEEE
16 years 3 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas
104
Voted
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 7 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
GLOBECOM
2007
IEEE
15 years 8 months ago
ARMA Synthesis of Fading Channels- an Application to the Generation of Dynamic MIMO Channels
— Adaptive transceivers play an important role in wireless communications and the design of MIMO systems. Therefore models that enable simulation of dynamic and time varying chan...
Hani Mehrpouyan, Steven D. Blostein
123
Voted
ATAL
2003
Springer
15 years 7 months ago
A decision making procedure for collaborative planning
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
Timothy W. Rauenbusch, Barbara J. Grosz
CCS
2010
ACM
15 years 1 months ago
Modeling attacks on physical unclonable functions
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...