Sciweavers

3368 search results - page 354 / 674
» The Complexity of Query Reliability
Sort
View
CVPR
2010
IEEE
15 years 6 months ago
Exploiting Monge structures in optimum subwindow search
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...
Senjian An, Patrick Peursum, Wanquan Liu, Svetha V...
SIGSOFT
2005
ACM
16 years 7 months ago
Moose: an agile reengineering environment
Software systems are complex and difficult to analyze. Reengineering is a complex activity that usually involves combining different techniques and tools. Moose is an reengineerin...
Oscar Nierstrasz, Stéphane Ducasse, Tudor G...
SIGSOFT
2005
ACM
16 years 7 months ago
The story of moose: an agile reengineering environment
Moose is a language-independent environment for reverseand re-engineering complex software systems. Moose provides a set of services including a common meta-model, metrics evaluat...
Oscar Nierstrasz, Stéphane Ducasse, Tudor G...
WWW
2005
ACM
16 years 7 months ago
Constructing extensible XQuery mappings
Constructing and maintaining semantic mappings are necessary but troublesome in data sharing systems. While most current work focuses on seeking automated techniques to solve this...
Gang Qian, Yisheng Dong
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 7 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson