Sciweavers

57 search results - page 6 / 12
» Elastic time computation in QoS-driven hypermedia presentati...
Sort
View
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
12 years 10 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
EUROMICRO
2000
IEEE
13 years 11 months ago
Supporting Cooperative Learning of Process Knowledge on the World Wide Web
The WWW makes learning materials widely accessible and provides an environment where people can learn across time and space. However, the simple read-only information structure on...
Weigang Wang, Jörg M. Haake, Jessica Rubart, ...
CHI
2011
ACM
12 years 11 months ago
Skim reading by satisficing: evidence from eye tracking
Readers on the Web often skim through text to cope with the volume of available information. In a previous study [11] readers’ eye movements were tracked as they skimmed through...
Geoffrey B. Duggan, Stephen J. Payne
TOG
2002
162views more  TOG 2002»
13 years 7 months ago
Interactive skeleton-driven dynamic deformations
This paper presents a framework for the skeleton-driven animation of elastically deformable characters. A character is embedded in a coarse volumetric control lattice, which provi...
Steve Capell, Seth Green, Brian Curless, Tom Ducha...