Sciweavers

116 search results - page 21 / 24
» views 1996
Sort
View
MST
2007
167views more  MST 2007»
13 years 7 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 7 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell
BMCBI
2005
131views more  BMCBI 2005»
13 years 7 months ago
Critical evaluation of the JDO API for the persistence and portability requirements of complex biological databases
Background: Complex biological database systems have become key computational tools used daily by scientists and researchers. Many of these systems must be capable of executing on...
Marko Srdanovic, Ulf Schenk, Michael Schwieger, Fa...
APGV
2004
ACM
145views Visualization» more  APGV 2004»
14 years 1 months ago
Conveying three-dimensional shape with texture
Studies have shown that although shading can give an image a ”natural” look and is an important shape cue, visual perception of surface shape from shading only is severely lim...
Sunghee Kim, Haleh Hagh-Shenas, Victoria Interrant...
FOCS
2008
IEEE
14 years 2 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson