890 search results - page 106 / 178 » An Experimental Comparison of Stereo Algorithms |
193
click to vote
CSCLP
2005
Springer
16 years 8 days ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
169
click to vote
DAWAK
2005
Springer
16 years 8 days ago
2005
Springer
To preserve private information while providing thorough analysis is one of the significant issues in OLAP systems. One of the challenges in it is to prevent inferring the sensitiv...
160
Voted
IDA
2005
Springer
16 years 7 days ago
2005
Springer
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
175
Voted
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
16 years 6 days ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
173
click to vote
PERVASIVE
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Location-awareness is useful for mobile and pervasive computing. We present a novel adaptive framework for recognizing personally important locations in cellular networks...