Sciweavers

422 search results - page 41 / 85
» On combinations of CMA equalizers
Sort
View
PAMI
2008
208views more  PAMI 2008»
14 years 9 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
TCS
2008
14 years 9 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...
RTS
2002
113views more  RTS 2002»
14 years 9 months ago
Feedback-Feedforward Scheduling of Control Tasks
A scheduling architecture for real-time control tasks is proposed. The scheduler uses feedback from execution-time measurements and feedforward from workload changes to adjust the...
Anton Cervin, Johan Eker, Bo Bernhardsson, Karl-Er...
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 8 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
JCT
2010
79views more  JCT 2010»
14 years 4 months ago
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
Rudi Pendavingh, Stefan H. M. van Zwam