4313 search results - page 635 / 863 » Using time travel to diagnose computer problems |
209
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
228
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
250
click to vote
TALG
2008
15 years 7 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
205
click to vote
GI
2009
Springer
15 years 12 months ago
2009
Springer
: In ubiquitous environments computers and smart devices, especially the technical view on them, disappear and users are supported to concentrate on the tasks they actually intend ...
196
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 4 months ago
2010
Eurographics
Hierarchical culling is a key acceleration technique used to efficiently handle massive models for ray tracing, collision detection, etc. To support such hierarchical culling, bo...