1326 search results - page 199 / 266 » Approximate Tree Kernels |
202
click to vote
VLDB
2008
ACM
16 years 5 months ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
162
Voted
EURODAC
1994
IEEE
15 years 9 months ago
1994
IEEE
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
185
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
179
click to vote
ORL
2006
15 years 5 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
167
click to vote
RECOMB
2007
Springer
16 years 5 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...