3281 search results - page 78 / 657 » Bases for parametrized iterativity |
118
click to vote
ISCAS
1999
IEEE
15 years 5 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
116
click to vote
FIMI
2003
15 years 3 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
118
click to vote
AIPS
2010
15 years 1 months ago
2010
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
140
click to vote
TSP
2008
15 years 1 months ago
2008
Abstract--An iterative joint channel estimation, symbol detection, phase recovery and interference cancellation structure is proposed for asynchronous code-division multiple-access...
123
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
–Retransmission based schemes are not suitable for energy constrained wireless sensor networks. Hence, there is an interest in including parity bits in each packet for error cont...