5022 search results - page 497 / 1005 » Data structures and problem solving using Java |
190
click to vote
CVPR
2009
IEEE
17 years 11 hour ago
2009
IEEE
Manually labeled landmark sets are often required as in-
puts for landmark-based image registration. Identifying an
optimal subset of landmarks from a training dataset may be
us...
153
click to vote
ESWS
2007
Springer
15 years 11 months ago
2007
Springer
Traditional process support systems typically offer a static composition of atomic tasks to more powerful services. In the real world, however, processes change over time: busines...
171
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
162
click to vote
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
138
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...