Sciweavers

5329 search results - page 972 / 1066
» The Weighted Majority Algorithm
Sort
View
129
Voted
ERCIMDL
2001
Springer
131views Education» more  ERCIMDL 2001»
15 years 8 months ago
An On-Line Document Clustering Method Based on Forgetting Factors
Abstract. With the rapid development of on-line information services, information technologies for on-line information processing have been receiving much attention recently. Clust...
Yoshiharu Ishikawa, Yibing Chen, Hiroyuki Kitagawa
ICDCS
2000
IEEE
15 years 8 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
144
Voted
VISUALIZATION
1999
IEEE
15 years 7 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis
120
Voted
INFOCOM
1993
IEEE
15 years 7 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
144
Voted
SIGGRAPH
1994
ACM
15 years 7 months ago
Zippered polygon meshes from range images
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to ...
Greg Turk, Marc Levoy