Sciweavers

3096 search results - page 448 / 620
» The Generalized FITC Approximation
Sort
View
ICML
1999
IEEE
16 years 7 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
SIGSOFT
2008
ACM
16 years 7 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
SIGSOFT
2006
ACM
16 years 7 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
SIGSOFT
2005
ACM
16 years 7 months ago
Performance data collection using a hybrid approach
Performance profiling consists of monitoring a software system during execution and then analyzing the obtained data. There are two ways to collect profiling data: event tracing t...
Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzal...
WWW
2008
ACM
16 years 7 months ago
A new aggregation policy for RSS services
RSS is the XML-based format for syndication of Web contents, and users aggregate RSS feeds with RSS feed aggregators. There are RSS aggregation policies that help aggregate RSS fe...
Young Geun Han, Sang Ho Lee, Jae Hwi Kim, Yanggon ...