Sciweavers

7015 search results - page 1271 / 1403
» Approximation algorithms for co-clustering
Sort
View
EOR
2008
78views more  EOR 2008»
13 years 9 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
CAD
2006
Springer
13 years 9 months ago
A rational extension of Piegl's method for filling n-sided holes
N-sided hole filling plays an important role in vertex blending. To deal with the case that the corner is surrounded by rational surfaces (i.e. NURBS surfaces), an algorithm to fi...
Yi-Jun Yang, Jun-Hai Yong, Hui Zhang, Jean-Claude ...
CAGD
2006
120views more  CAGD 2006»
13 years 9 months ago
Quality meshing of implicit solvation models of biomolecular structures
This paper describes a comprehensive approach to construct quality meshes for implicit solvation models of biomolecular structures starting from atomic resolution data in the Prot...
Yongjie Zhang, Guoliang Xu, Chandrajit L. Bajaj
CGF
2006
166views more  CGF 2006»
13 years 9 months ago
Rendering Soft Shadows using Multilayered Shadow Fins
Generating soft shadows in real time is difficult. Exact methods (such as ray tracing, and multiple light source simulation) are too slow, while approximate methods often overesti...
Xiao-Hua Cai, Yun-Tao Jia, Xi Wang, Shi-Min Hu, Ra...
DKE
2006
125views more  DKE 2006»
13 years 9 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
« Prev « First page 1271 / 1403 Last » Next »