Sciweavers

1478 search results - page 71 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
WSCG
2004
136views more  WSCG 2004»
13 years 10 months ago
Conceptual Models for Describing Virtual Worlds
A conceptual model of a virtual world is a high-level representation of how the objects behave and how they are related to each other. The conceptual models identify the most esse...
François Bernier, E. Boivin, Denis Laurende...
SDM
2010
SIAM
256views Data Mining» more  SDM 2010»
13 years 10 months ago
The Application of Statistical Relational Learning to a Database of Criminal and Terrorist Activity
We apply statistical relational learning to a database of criminal and terrorist activity to predict attributes and event outcomes. The database stems from a collection of news ar...
B. Delaney, Andrew S. Fast, W. M. Campbell, C. J. ...
GIS
2010
ACM
13 years 7 months ago
Decentralized querying of topological relations between regions without using localization
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...
Matt Duckham, Myeong Hun Jeong, Sanjiang Li, Joche...
MP
2006
134views more  MP 2006»
13 years 9 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 2 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy