Sciweavers

1995 search results - page 200 / 399
» What's the Problem
Sort
View
139
Voted
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
16 years 4 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 4 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
ENC
2004
IEEE
15 years 8 months ago
A New Cache Approach Based on Graph for Web Servers
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
Euloge Edi, Denis Trystram, Jean-Marc Vincent
159
Voted
WEBI
2007
Springer
15 years 10 months ago
OOPS: User Modeling Method for Task Oriented Mobile Internet Services
Growth in the mobile services industry has remarkably increased in the number of mobile services provided, and present methods of service provision have proven insufficient to gui...
Munehiko Sasajima, Yoshinobu Kitamura, Takefumi Na...
139
Voted
GECCO
2006
Springer
142views Optimization» more  GECCO 2006»
15 years 8 months ago
Classifier prediction based on tile coding
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...