15073 search results - page 383 / 3015 » Probabilistic algorithms for computing resultants |
174
Voted
TELETRAFFIC
2007
Springer
16 years 8 days ago
2007
Springer
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
170
click to vote
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
179
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
162
Voted
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
127
click to vote
ISCAS
2008
IEEE
16 years 16 days ago
2008
IEEE
— We study the problem of automatic musical beat tracking from acoustic data, i.e., finding locations of beats of a music piece by computers on-the-fly, in this work. An online...