15073 search results - page 2662 / 3015 » Probabilistic algorithms for computing resultants |
150
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
253
Voted
VLDB
2006
ACM
16 years 4 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
155
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
123
click to vote
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
Placement is one of the most important steps in the RTLto-GDSII synthesis process, as it directly defines the interconnects, which have become the bottleneck in circuit and syste...
163
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...