Sciweavers

2080 search results - page 183 / 416
» Measuring empirical computational complexity
Sort
View
PE
2007
Springer
112views Optimization» more  PE 2007»
15 years 6 months ago
Multicast inference of temporal loss characteristics
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
Vijay Arya, Nick G. Duffield, Darryl Veitch
COMPGEOM
2011
ACM
14 years 10 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
ICSE
2009
IEEE-ACM
16 years 1 months ago
Deployment automation with BLITZ
Minimizing the computing infrastructure (such as processors) in a distributed real-time embedded (DRE) system deployment helps reduce system size, weight, power consumption, and c...
Brian Dougherty, Jules White, Jaiganesh Balasubram...
ICRA
2009
IEEE
83views Robotics» more  ICRA 2009»
16 years 1 months ago
Real-time correlative scan matching
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
Edwin B. Olson
DAC
1996
ACM
15 years 10 months ago
A Probability-Based Approach to VLSI Circuit Partitioning
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
Shantanu Dutt, Wenyong Deng