2342 search results - page 66 / 469 » Sublinear geometric algorithms |
102
click to vote
CIKM
2011
Springer
14 years 19 days ago
2011
Springer
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
110
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
117
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
FUN
2007
Springer
15 years 6 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
107
click to vote
ESA
1999
Springer
15 years 5 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...