Sciweavers

3265 search results - page 551 / 653
» Representing Groups on Graphs
Sort
View
LICS
1997
IEEE
15 years 9 months 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...
CCS
2010
ACM
15 years 9 months ago
Towards publishing recommendation data with predictive anonymization
Recommender systems are used to predict user preferences for products or services. In order to seek better prediction techniques, data owners of recommender systems such as Netfli...
Chih-Cheng Chang, Brian Thompson, Hui (Wendy) Wang...
DSN
2009
IEEE
15 years 9 months ago
Precise request tracing and performance debugging for multi-tier services of black boxes
As more and more multi-tier services are developed from commercial components or heterogeneous middleware without the source code available, both developers and administrators nee...
Zhihong Zhang, Jianfeng Zhan, Yong Li, Lei Wang, D...
VISSYM
2007
15 years 8 months ago
Visualization of Uncertainty in Lattices to Support Decision-Making
Lattice graphs are used as underlying data structures in many statistical processing systems, including natural language processing. Lattices compactly represent multiple possible...
Christopher Collins, M. Sheelagh T. Carpendale, Ge...
ATAL
2008
Springer
15 years 7 months ago
Discovering tactical behavior patterns supported by topological structures in soccer agent domains
Behaviors in soccer-agent domains can involve individual plays, several players involved in tactical plays or the whole team trying to follow strategies supported by specific form...
Fernando Ramos, Huberto Ayanegui