Sciweavers

2190 search results - page 416 / 438
» An optimal algorithm to generate tilings
Sort
View
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
15 years 7 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee
ICSM
1994
IEEE
15 years 6 months ago
A Framework for Partial Data Flow Analysis
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
Rajiv Gupta, Mary Lou Soffa
COLT
2004
Springer
15 years 5 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
ORL
1998
116views more  ORL 1998»
15 years 1 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
MMB
2012
Springer
259views Communications» more  MMB 2012»
13 years 9 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...