Sciweavers

6894 search results - page 1145 / 1379
» Generation Problems
Sort
View
CONCURRENCY
2008
112views more  CONCURRENCY 2008»
15 years 6 months ago
Building and applying geographical information system Grids
: We discuss the development and application of Web Service-based Geographical Information System Grids. Following the WS-I+ approach of building Grids on Web Service standards, we...
Galip Aydin, Ahmet Sayar, Harshawardhan Gadgil, Me...
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 6 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
Optimally Sparse Frames
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
Peter G. Casazza, Andreas Heinecke, Felix Krahmer,...
DEBU
2010
104views more  DEBU 2010»
15 years 6 months ago
Query Results Ready, Now What?
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
Ziyang Liu, Yi Chen
DM
2010
140views more  DM 2010»
15 years 6 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
« Prev « First page 1145 / 1379 Last » Next »