Sciweavers

2080 search results - page 385 / 416
» Measuring empirical computational complexity
Sort
View
145
Voted
COMPGEOM
2006
ACM
15 years 11 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
165
Voted
ICCV
2005
IEEE
15 years 10 months ago
Surface Parameterization Using Riemann Surface Structure
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...
139
Voted
SIGCOMM
2003
ACM
15 years 10 months ago
A knowledge plane for the internet
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as re...
David D. Clark, Craig Partridge, J. Christopher Ra...
SPAA
2010
ACM
15 years 9 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
VISSYM
2007
15 years 7 months ago
Parametric Visualization of High Resolution Correlated Multi-spectral Features Using PCA
An imaging mass spectrometer is an analytical instrument that can determine the spatial distribution of chemical compounds on complex surfaces. The output of the device is a multi...
Alexander Broersen, Robert van Liere, Ron M. A. He...