Sciweavers

836 search results - page 125 / 168
» On the Complexity of Train Assignment Problems
Sort
View
COMPGEOM
2004
ACM
15 years 9 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
COMPGEOM
2010
ACM
15 years 9 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ICIP
2007
IEEE
16 years 5 months ago
Color Image Superresolution Based on a Stochastic Combinational Classification-Regression Algorithm
Abstract - The proposed algorithm in this work provides superresolution for color images by using a learning based technique that utilizes both generative and discriminant approach...
Karl S. Ni, Truong Q. Nguyen
BMCBI
2005
131views more  BMCBI 2005»
15 years 4 months ago
Regularized Least Squares Cancer Classifiers from DNA microarray data
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...
Nicola Ancona, Rosalia Maglietta, Annarita D'Addab...
CVPR
2005
IEEE
16 years 6 months ago
Decentralized Multiple Target Tracking Using Netted Collaborative Autonomous Trackers
This paper presents a decentralized approach to multiple target tracking. The novelty of this approach lies in the use of a set of autonomous while collaborative trackers to overc...
Ting Yu, Ying Wu