Sciweavers

2080 search results - page 148 / 416
» Measuring empirical computational complexity
Sort
View
CHI
2003
ACM
16 years 4 months ago
Dynamic query sliders vs. brushing histograms
Dynamic queries facilitate exploration of information through real-time visual display of both query formulation and results. Dynamic query sliders are linked to the main visualiz...
Qing Li, Xiaofeng Bao, Chen Song, Jinfei Zhang, Ch...
124
Voted
DCC
2001
IEEE
16 years 4 months ago
Compression of the Layered Depth Image
A layered depth image (LDI) is a new popular representation and rendering method for objects with complex geometries. Similar to a 2D image, the LDI consists of an array of pixels...
Jiangang Duan, Jin Li
ACG
2009
Springer
15 years 11 months ago
Automated Discovery of Search-Extension Features
One of the main challenges with selective search extensions is designing effective move categories (features). This is a manual trial and error task, which requires both intuition...
Pálmi Skowronski, Yngvi Björnsson, Mar...
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
15 years 11 months ago
Using automated search to generate test data for matlab
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...
Sion Ll Rhys, Simon M. Poulding, John A. Clark
IEEEARES
2008
IEEE
15 years 11 months ago
Assessing the Reliability and Cost of Web and Grid Orchestrations
Unreliability is a characteristic feature of web and grid based computation: a call to a web or grid site may or may not succeed. An orchestration manager aims to control web or g...
Alan Stewart, Maurice Clint, Terry Harmer, Peter K...