Sciweavers

603 search results - page 105 / 121
» Word or Phrase
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
HICSS
2002
IEEE
106views Biometrics» more  HICSS 2002»
14 years 18 days ago
Satisfaction with Internet-Based Services
: This research develops, operationalizes, and empirically tests a model for explaining/predicting the satisfaction of customers with Internet-based services in the context of an o...
Mohamed Khalifa, Vanessa Liu
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 7 hour ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
VISUALIZATION
1999
IEEE
13 years 12 months ago
Rendering on a Budget: A Framework for Time-Critical Rendering
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
James T. Klosowski, Cláudio T. Silva
VVS
1998
IEEE
106views Visualization» more  VVS 1998»
13 years 12 months ago
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
Cláudio T. Silva, Joseph S. B. Mitchell, Pe...