Sciweavers

175 search results - page 24 / 35
» One Update for all Moving Objects at a Timestamp
Sort
View
WAE
2001
222views Algorithms» more  WAE 2001»
13 years 9 months ago
An Experimental Study of Data Migration Algorithms
The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing u...
Eric J. Anderson, Joseph Hall, Jason D. Hartline, ...
ICSOC
2009
Springer
14 years 2 months ago
Web Service Search on Large Scale
The Web is nowadays moving from a Web of data to a Web of services. In this paper we present our approach for Web Service discovery on Web scale, targeted to support flexible and ...
Nathalie Steinmetz, Holger Lausen, Manuel Brunner
ICC
2007
IEEE
105views Communications» more  ICC 2007»
13 years 11 months ago
Multiuser Discrete Bit-loading for Digital Subscriber Lines
This paper proposes an efficient algorithm that produces near-optimal discrete bit-loading for a Gaussian interference channel that models a DSL network. It first takes a continuou...
David D. Yu, Kibeom Seong, John M. Cioffi
CAGD
2004
87views more  CAGD 2004»
13 years 7 months ago
Gliding spline motions and applications
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...
Johannes Wallner
ECOOP
2007
Springer
13 years 11 months ago
Synchronizing Refactored UML Class Diagrams and OCL Constraints
UML class diagrams are usually annotated with OCL expressions that constrain their possible instantiation. In our work we have investigated how OCL annotations can be automatically...
Slavisa Markovic, Thomas Baar