Sciweavers

4118 search results - page 421 / 824
» Efficient Algorithms for Airline Problem
Sort
View
AI
2010
Springer
15 years 6 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 6 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer
CSCW
2002
ACM
15 years 6 months ago
Achieving undo in bitmap-based collaborative graphics editing systems
Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Ex...
Xueyi Wang, Jiajun Bu, Chun Chen
TIT
2002
125views more  TIT 2002»
15 years 6 months ago
Optimal bi-level quantization of i.i.d. sensor observations for binary hypothesis testing
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
Qian Zhang, Pramod K. Varshney, Richard D. Wesel
JMLR
2010
151views more  JMLR 2010»
15 years 1 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu