6409 search results - page 1048 / 1282 » A Computational Algorithm for Origami Design |
272
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
196
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
178
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
192
click to vote
APPROX
2007
Springer
16 years 21 days ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
196
click to vote
CIKM
2007
Springer
16 years 21 days ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...