255 search results - page 23 / 51 » A new upper bound for the bipartite Ramsey problem |
117
Voted
WAOA
2007
Springer
16 years 6 days ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
179
click to vote
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
135
Voted
CCCG
2006
15 years 7 months ago
2006
We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
143
Voted
ICASSP
2008
IEEE
16 years 16 days ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
156
click to vote
ACL
1990
15 years 7 months ago
1990
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...