2173 search results - page 173 / 435 » On the Values of Reducibility Candidates |
201
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
215
click to vote
CONIELECOMP
2011
IEEE
14 years 10 months ago
2011
IEEE
This work focuses on developing systems of blocks in SIMULINK and VHDL to reuse on design of applications involving the recognition of polygonal objects. Usage of this work reduce...
355
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
218
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
196
click to vote
IUI
2012
ACM
14 years 2 months ago
2012
ACM
One Feature (1F) is a simple and intuitive pruning strategy that reduces considerably the amount of computations required by Nearest-Neighbor gesture classifiers while still pres...