Sciweavers

2957 search results - page 459 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
SENSYS
2006
ACM
14 years 4 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
JCDL
2005
ACM
84views Education» more  JCDL 2005»
14 years 3 months ago
Turning the page on navigation
In this paper, we discuss the findings of an in-depth observational study of reading and within-document navigation and add to these findings the results of a second analysis of h...
Catherine C. Marshall, Sara A. Bly
WEBDB
2005
Springer
88views Database» more  WEBDB 2005»
14 years 3 months ago
Vague Content and Structure (VCAS) Retrieval for Document-centric XML Collections
Querying document-centric XML collections with structure conditions improves retrieval precisions. The structures of such XML collections, however, are often too complex for users...
Shaorong Liu, Wesley W. Chu, Ruzan Shahinian
SIGGRAPH
2010
ACM
14 years 2 months ago
Paneling architectural freeform surfaces
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
Michael Eigensatz, Martin Kilian, Alexander Schift...
SIGGRAPH
2010
ACM
14 years 2 months ago
Interactive hair rendering under environment lighting
We present an algorithm for interactive hair rendering with both single and multiple scattering effects under complex environment lighting. The outgoing radiance due to single sca...
Zhong Ren, Kun Zhou, Tengfei Li, Wei Hua, Baining ...