Sciweavers

824 search results - page 46 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
POPL
2009
ACM
16 years 14 days ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
SPATIALCOGNITION
1998
Springer
15 years 4 months ago
Judging Spatial Relations from Memory
Representations and processes involved in judgments of spatial relations after route learning are investigated. The main objective is to decide which relations are explicitly repre...
Rainer Rothkegel, Karl Friedrich Wender, Sabine Sc...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
15 years 5 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
IIE
2006
74views more  IIE 2006»
14 years 11 months ago
Guidelines on the Design of Effective CBL Environments
This paper summarizes two studies and the contemporary literature on the design and construction of effective and efficient Computer Based Learning (CBL) environments. There is ade...
Athanasis Karoulis
ATAL
2010
Springer
15 years 28 days ago
Strategy-proof allocation of multiple items between two agents without payments or priors
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
Mingyu Guo, Vincent Conitzer