Sciweavers

2600 search results - page 228 / 520
» Clustering with or without the Approximation
Sort
View
GCC
2005
Springer
16 years 22 days ago
An Efficient Network Information Model Using NWS for Grid Computing Environments
Grid computing technologies enable large-scale aggregation and sharing of resources via wide-area networks focused on sharing computational, data, and other resources to form gener...
Chao-Tung Yang, Po-Chi Shih, Sung-Yi Chen, Wen-Chu...
ICALP
2005
Springer
16 years 22 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
INFOCOM
2003
IEEE
16 years 15 days ago
A Queueing Network Model of an Edge Optical Burst Switching Node
— We consider an edge optical burst switching (OBS) node with or without converters, and with no buffering. The OBS node serves a number of users, each connected to the switch ov...
Lisong Xu, Harry G. Perros, George N. Rouskas
IMR
2003
Springer
16 years 12 days ago
Geodesic-based Surface Remeshing
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
Oren Sifri, Alla Sheffer, Craig Gotsman
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
15 years 11 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...