1596 search results - page 91 / 320 » Human-Guided Simple Search |
148
click to vote
SIBGRAPI
2008
IEEE
15 years 10 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
151
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
155
Voted
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
Collection selection has been a research issue for years. Typically, in related work, precomputed statistics are employed in order to estimate the expected result quality of each ...
147
click to vote
WEBDB
2010
Springer
15 years 9 months ago
2010
Springer
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
149
click to vote
CG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...