Sciweavers

2907 search results - page 153 / 582
» Presentations of Structures in Admissible Sets
Sort
View
PAMI
2008
176views more  PAMI 2008»
15 years 6 months ago
Learning Flexible Features for Conditional Random Fields
Abstract-- Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increas...
Liam Stewart, Xuming He, Richard S. Zemel
INFSOF
2007
81views more  INFSOF 2007»
15 years 6 months ago
An infrastructure to support interoperability in reverse engineering
An infrastructure is a set of interconnected structural elements, such as tools and schemas, that provide a framework for supporting an entire structure. The reverse engineering c...
Nicholas A. Kraft, Brian A. Malloy, James F. Power
CORR
1998
Springer
105views Education» more  CORR 1998»
15 years 6 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
CVPR
2007
IEEE
16 years 8 months ago
A contextual dissimilarity measure for accurate and efficient image search
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
Herve Jegou, Hedi Harzallah, Cordelia Schmid
LATIN
2010
Springer
16 years 1 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...