236 search results - page 20 / 48 » Binary Partitions Revisited |
141
click to vote
ICWS
2010
IEEE
15 years 5 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
168
Voted
DATAMINE
1999
15 years 3 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
120
click to vote
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
124
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
–- To obtain optimal location area (LA) partitioning in cellular radio networks is important since it maximizes the usable bandwidth to support services. However, we feel that th...
148
Voted
VLSID
2005
IEEE
15 years 9 months ago
2005
IEEE
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...