5356 search results - page 203 / 1072 » Adventures in time and space |
172
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
200
click to vote
IWMM
2011
Springer
14 years 9 months ago
2011
Springer
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
192
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
274
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...