1689 search results - page 199 / 338 » Proximate point searching |
189
click to vote
CMOT
2010
15 years 3 months ago
2010
Planning a path to a destination, given a number of options and obstacles, is a common task. We suggest a two-component cognitive model that combines retrieval of knowledge about t...
172
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
173
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
189
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
179
click to vote
ICC
2007
IEEE
16 years 24 days ago
2007
IEEE
In a wireless network composed of multiple access points, a long delay during roaming from one access point to another may cause a disruption for streaming traffic. Roaming in wire...