3708 search results - page 282 / 742 » Approximating Betweenness Centrality |
142
click to vote
MFCS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
173
click to vote
IMR
2004
Springer
16 years 4 hour ago
2004
Springer
We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed onl...
143
click to vote
ISSAC
2004
Springer
16 years 1 hour ago
2004
Springer
We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a r...
143
click to vote
SIGGRAPH
2003
ACM
15 years 12 months ago
2003
ACM
We present techniques which create a consistent illumination between real and virtual objects inside an application specific optical see-through display: the Virtual Showcase. We ...
176
click to vote
ICANN
2001
Springer
15 years 11 months ago
2001
Springer
Kernel-based systems are currently very popular approaches to supervised learning. Unfortunately, the computational load for training kernel-based systems increases drastically wit...