Sciweavers

4066 search results - page 378 / 814
» Almost Complete Sets
Sort
View
DMGT
2011
94views more  DMGT 2011»
14 years 10 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
ICCV
2011
IEEE
14 years 6 months ago
Gaussian Process Regression Flow for Analysis of Motion Trajectories
Recognition of motions and activities of objects in videos requires effective representations for analysis and matching of motion trajectories. In this paper, we introduce a new r...
Kihwan Kim, Dongryeol Lee, Irfan Essa
IEEEPACT
2002
IEEE
15 years 11 months ago
Workload Design: Selecting Representative Program-Input Pairs
Having a representative workload of the target domain of a microprocessor is extremely important throughout its design. The composition of a workload involves two issues: (i) whic...
Lieven Eeckhout, Hans Vandierendonck, Koenraad De ...
COLT
1993
Springer
15 years 11 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
BMCBI
2008
114views more  BMCBI 2008»
15 years 7 months ago
Visualizing and clustering high throughput sub-cellular localization imaging
Background: The expansion of automatic imaging technologies has created a need to be able to efficiently compare and review large sets of image data. To enable comparisons of imag...
Nicholas A. Hamilton, Rohan D. Teasdale