Sciweavers

119 search results - page 19 / 24
» Towards Automated Synthesis of Data Mining Programs
Sort
View
LICS
1997
IEEE
15 years 3 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
109
Voted
APSEC
2001
IEEE
15 years 3 months ago
Expert Maintainers' Strategies and Needs when Understanding Software: A Case Study Approach
Accelerating the learning curve of software maintainers working on systems with which they have little familiarity motivated this study. A working hypothesis was that automated me...
Christos Tjortjis, Paul J. Layzell
TSE
2008
91views more  TSE 2008»
14 years 11 months ago
Privately Finding Specifications
Buggy software is a reality and automated techniques for discovering bugs are highly desirable. A specification describes the correct behavior of a program. For example, a file mus...
Westley Weimer, Nina Mishra
IEEEPACT
2008
IEEE
15 years 6 months ago
The PARSEC benchmark suite: characterization and architectural implications
This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs). Prev...
Christian Bienia, Sanjeev Kumar, Jaswinder Pal Sin...
WISE
2009
Springer
15 years 8 months ago
Web Queries: From a Web of Data to a Semantic Web
ct One significant effort towards combining the virtues of Web search, viz. being accessible to untrained users and able to cope with vastly heterogeneous data, with those of dat...
François Bry, Tim Furche, Klara A. Weiand