Sciweavers

3656 search results - page 25 / 732
» Compact Location Problems
Sort
View
IVC
2008
147views more  IVC 2008»
13 years 9 months ago
Distinctive and compact features
We consider the problem of extracting features for multi-class recognition problems. The features are required to make fine distinction between similar classes, combined with tole...
Ayelet Akselrod-Ballin, Shimon Ullman
ICTAI
2005
IEEE
14 years 3 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
SIAMNUM
2011
124views more  SIAMNUM 2011»
13 years 4 months ago
Discrete Compactness for the p-Version of Discrete Differential Forms
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
Daniele Boffi, Martin Costabel, Monique Dauge, Les...
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
14 years 6 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
CSDA
2007
115views more  CSDA 2007»
13 years 9 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...