Sciweavers

176 search results - page 33 / 36
» Unbalanced Points and Vertices Problem
Sort
View
CVPR
2000
IEEE
15 years 11 months ago
On the Number of Samples Needed in Light Field Rendering with Constant-Depth Assumption
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
Zhouchen Lin, Heung-Yeung Shum
FOCS
2008
IEEE
15 years 3 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
COMPGEOM
2011
ACM
14 years 29 days ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
SIAMDM
2010
149views more  SIAMDM 2010»
14 years 7 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
CHI
2009
ACM
15 years 10 months ago
A comparative study of interaction metaphors for large-scale displays
Large screen displays require new interaction techniques because of their physical size. Even though there are technologies that tackle the problem of interaction with such device...
Ricardo Jota, João Madeiras Pereira, Joaqui...