Sciweavers

11151 search results - page 162 / 2231
» On the Complexity of Model Expansion
Sort
View
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
15 years 8 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
CVPR
2001
IEEE
16 years 6 months ago
Automatic Description of Buildings with Complex Rooftops from Multiple Images
We present a model-based approach to detecting and describing compositions of buildings with complex rooftops. Previous approaches have dealt with either simpler models or models ...
Zu Whan Kim, Andres Huertas, Ramakant Nevatia
CISIS
2009
IEEE
15 years 9 months ago
Creation and Delivery of Complex Learning Experiences: The ELeGI Approach
The paper presents the main findings of the ELeGI project, namely its learning model and software architecture to support the creation and execution of complex learning processes....
Nicola Capuano, Angelo Gaeta, Agostino Marengo, Se...
HCI
2007
15 years 6 months ago
Measuring the Screen Complexity of Web Pages
An increasing, degree of rich and dynamic content and abundant links are making Web pages visually cluttered. This paper presents a numerical tool to evaluate the screen complexity...
Fong-Ling Fu, Shao-Yuan Chiu, Chiu Hung Su
WSC
2004
15 years 6 months ago
A Probabilistic Total System Approach to the Simulation of Complex Environmental Systems
GoldSim is a powerful and flexible Windows-based computer program for carrying out probabilistic simulations of complex systems to support management and decisionmaking in enginee...
Rick Kossik, Ian Miller