Sciweavers

17983 search results - page 287 / 3597
» Set Types and Applications
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 6 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
JOTA
2010
127views more  JOTA 2010»
15 years 1 months ago
Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
Henri Bonnel, C. Yalçin Kaya
201
Voted
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
16 years 1 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
16 years 9 days ago
Finding Representative Set from Massive Data
In the information age, data is pervasive. In some applications, data explosion is a significant phenomenon. The massive data volume poses challenges to both human users and comp...
Feng Pan, Wei Wang 0010, Anthony K. H. Tung, Jiong...
JCSS
2008
87views more  JCSS 2008»
15 years 6 months ago
Finding large 3-free sets I: The small n case
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free....
William I. Gasarch, James Glenn, Clyde P. Kruskal