Sciweavers

2168 search results - page 164 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
CGI
1999
IEEE
15 years 8 months ago
Volume Decimation of Irregular Tetrahedral Grids
Rendering highly complex models can be time and space prohibitive, and decimation is an important tool in providing simplifications. A decimated model may replace the original ent...
Allen Van Gelder, Vivek Verma, Jane Wilhelms
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 4 months ago
The Design and Performance of a Bare PC Web Server
There is an increasing need for new Web server architectures that are application-centric, simple, small, and pervasive in nature. In this paper, we present a novel architecture f...
Long He, Ramesh K. Karne, Alexander L. Wijesinha
PRESENCE
2007
113views more  PRESENCE 2007»
15 years 3 months ago
Perceived Instability of Virtual Haptic Texture: III. Effect of Update Rate
This study investigates the effect of update rate on the quality of haptic virtual textures, with the goal to develop a guideline for choosing an optimal update rate for haptic te...
Seungmoon Choi, Hong Z. Tan
GD
2009
Springer
15 years 9 months ago
Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
Tim Dwyer, Lev Nachmanson
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 9 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál