Sciweavers

211 search results - page 17 / 43
» Solving Games Without Determinization
Sort
View
EMNLP
2006
14 years 11 months ago
Context-Dependent Term Relations for Information Retrieval
Co-occurrence analysis has been used to determine related words or terms in many NLP-related applications such as query expansion in Information Retrieval (IR). However, related w...
Jing Bai, Jian-Yun Nie, Guihong Cao
ALGOSENSORS
2004
Springer
15 years 3 months ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...
APPML
2008
159views more  APPML 2008»
14 years 10 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho
CVPR
2007
IEEE
16 years 12 days ago
A minimal solution to the autocalibration of radial distortion
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
Tomás Pajdla, Zuzana Kukelova
ATAL
2009
Springer
15 years 5 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski