Sciweavers

583 search results - page 44 / 117
» On small blocking sets and their linearity
Sort
View
ISBI
2004
IEEE
14 years 9 months ago
Local Feature Matching Using Entropic Graphs
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson...
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 10 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
VTS
2003
IEEE
115views Hardware» more  VTS 2003»
14 years 2 months ago
Fault Testing for Reversible Circuits
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
Ketan N. Patel, John P. Hayes, Igor L. Markov
PR
2006
102views more  PR 2006»
13 years 8 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh