Sciweavers

6740 search results - page 1258 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
LICS
1997
IEEE
15 years 3 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...
UIST
1995
ACM
15 years 3 months ago
3-Dimensional Pliable Surfaces: For the Effective Presentation of Visual Information
A fundamental issue in user interface design is the effective use of available screen space, commonly referred to as the screen real estate problem. This paper presents a new dist...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
ICLP
1989
Springer
15 years 3 months ago
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
Kalyan Muthukumar, Manuel V. Hermenegildo
CCS
2010
ACM
15 years 3 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...
AAAI
2007
15 years 2 months ago
Isometric Projection
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
Deng Cai, Xiaofei He, Jiawei Han
« Prev « First page 1258 / 1348 Last » Next »