Sciweavers

1727 search results - page 166 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
SCAM
2007
IEEE
16 years 23 days ago
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...
Eva Magnusson, Torbjörn Ekman, Görel Hed...
CVPR
2003
IEEE
16 years 8 months ago
Recognizing Objects in Adversarial Clutter: Breaking a Visual CAPTCHA
In this paper we explore object recognition in clutter. We test our object recognition techniques on Gimpy and EZGimpy, examples of visual CAPTCHAs. A CAPTCHA ("Completely Au...
Greg Mori, Jitendra Malik
CCR
2004
105views more  CCR 2004»
15 years 6 months ago
The measurement manifesto
Useful measurement data is badly needed to help monitor and control large networks. Current approaches to solving measurement problems often assume minimal support from routers and...
George Varghese, Cristian Estan
JAR
1998
134views more  JAR 1998»
15 years 6 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
16 years 3 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz