2880 search results - page 343 / 576 » Approximate Range Searching |
187
Voted
DSD
2008
IEEE
15 years 5 months ago
2008
IEEE
Platform-based design represents the most widely used approach to design System-On-Chip (SOC) applications. In this context, the Design Space Exploration (DSE) phase consists of o...
116
Voted
LDTA
2010
15 years 3 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
139
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
117
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
133
Voted
JMLR
2010
14 years 10 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...