2913 search results - page 280 / 583 » How Much to Copy |
109
click to vote
IJON
2006
15 years 4 months ago
2006
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
129
click to vote
JSAT
2008
15 years 4 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
155
Voted
JIIS
2006
15 years 4 months ago
2006
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
110
click to vote
NECO
2008
15 years 4 months ago
2008
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
108
click to vote
MANSCI
2006
15 years 4 months ago
2006
Although there has been much attention in recent years on the effects of additive background risks, the same is not true for its multiplicative counterpart. We consider random wea...