Sciweavers

2517 search results - page 88 / 504
» Specifying Weak Sets
Sort
View
ECCV
2008
Springer
16 years 7 months ago
Multiple Component Learning for Object Detection
Abstract. Object detection is one of the key problems in computer vision. In the last decade, discriminative learning approaches have proven effective in detecting rigid objects, a...
Boris Babenko, Pietro Perona, Piotr Dollár,...
BMCBI
2006
139views more  BMCBI 2006»
15 years 5 months ago
DNA Molecule Classification Using Feature Primitives
Background: We present a novel strategy for classification of DNA molecules using measurements from an alpha-Hemolysin channel detector. The proposed approach provides excellent c...
Raja Tanveer Iqbal, Matthew Landry, Stephen Winter...
CORR
2011
Springer
185views Education» more  CORR 2011»
15 years 11 days ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
ICST
2009
IEEE
16 years 19 hour ago
A Test-Driven Approach to Developing Pointcut Descriptors in AspectJ
Aspect-oriented programming (AOP) languages introduce new constructs that can lead to new types of faults, which must be targeted by testing techniques. In particular, AOP languag...
Romain Delamare, Benoit Baudry, Sudipto Ghosh, Yve...
COMPGEOM
1995
ACM
15 years 9 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner