Sciweavers

2600 search results - page 250 / 520
» Clustering with or without the Approximation
Sort
View
JPDC
2007
138views more  JPDC 2007»
15 years 6 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
JAIR
2010
139views more  JAIR 2010»
15 years 5 months ago
Multiattribute Auctions Based on Generalized Additive Independence
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentia...
Yagil Engel, Michael P. Wellman
TCOM
2008
118views more  TCOM 2008»
15 years 5 months ago
Performance analysis for collaborative decoding with least-reliable-bits exchange on AWGN channels
Collaborative decoding is an approach that can achieve diversity and combining gain by exchanging decoding information among a cluster of physically separated receivers. On AWGN ch...
Xin Li, Tan F. Wong, John M. Shea
TOG
2010
157views more  TOG 2010»
15 years 1 months ago
Combining global and local virtual lights for detailed glossy illumination
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...
Tomás Davidovic, Jaroslav Krivánek, ...
ICDAR
2011
IEEE
14 years 6 months ago
Word Retrieval in Historical Document Using Character-Primitives
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
Partha Pratim Roy, Jean-Yves Ramel, Nicolas Ragot