Sciweavers

5022 search results - page 266 / 1005
» Data structures and problem solving using Java
Sort
View
125
Voted
ICFP
1999
ACM
15 years 7 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
128
Voted
ICRA
2006
IEEE
123views Robotics» more  ICRA 2006»
15 years 8 months ago
Simultaneous Localization and Mapping with Environmental Structure Prediction
—Traditionally, simultaneous localization and mapping (SLAM) algorithms solve the localization and mapping problem in explored regions. This paper presents a prediction-based SLA...
H. Jacky Chang, C. S. George Lee, Yung-Hsiang Lu, ...
135
Voted
AIR
2004
111views more  AIR 2004»
15 years 2 months ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
159
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
122
Voted
JUCS
2008
117views more  JUCS 2008»
15 years 2 months ago
Eliminating Cycles in Weak Tables
: Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tabl...
Alexandra Barros, Roberto Ierusalimschy