Sciweavers

12519 search results - page 2432 / 2504
» Approximation Problems Categories
Sort
View
ACMSE
2006
ACM
15 years 6 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
AMR
2006
Springer
119views Multimedia» more  AMR 2006»
15 years 6 months ago
The Potential of User Feedback Through the Iterative Refining of Queries in an Image Retrieval System
Inaccurate or ambiguous expressions in queries lead to poor results in information retrieval. We assume that iterative user feedback can improve the quality of queries. To this end...
Maher Ben Moussa, Marco Pasch, Djoerd Hiemstra, Pa...
146
Voted
CASES
2005
ACM
15 years 6 months ago
Architectural support for real-time task scheduling in SMT processors
In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architec...
Francisco J. Cazorla, Peter M. W. Knijnenburg, Riz...
ICSE
2010
IEEE-ACM
15 years 6 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
COMPGEOM
2005
ACM
15 years 6 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
« Prev « First page 2432 / 2504 Last » Next »