Sciweavers

1274 search results - page 216 / 255
» Graph lambda theories
Sort
View
GRAPHITE
2007
ACM
14 years 21 days ago
Anna Ursyn
This review tells about the International Conference on Information Visualization that is held annually in London, England. Themes selected from the Conference Proceedings are foc...
Anna Ursyn
LICS
1997
IEEE
14 years 12 days ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
13 years 11 months ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
CIKM
2008
Springer
13 years 10 months ago
An extended cooperative transaction model for xml
In many application areas, for example in design or media production processes, several authors have to work cooperatively on the same project. Thereby, a frequently used data for...
Francis Gropengießer, Kai-Uwe Sattler
COMPGEOM
2005
ACM
13 years 10 months ago
Dynamic maintenance of molecular surfaces under conformational changes
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
Eran Eyal, Dan Halperin