Sciweavers

760 search results - page 23 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
16 years 10 hour ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
JALC
2002
97views more  JALC 2002»
15 years 5 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ACL
1994
15 years 6 months ago
An automatic Method of Finding Topic Boundaries
This article outlines a new method of locating discourse boundaries based on lexical cohesion and a graphical technique called dotplotting. The application of dotplotting to disco...
Jeffrey C. Reynar
WWW
2007
ACM
16 years 6 months ago
Finding community structure in mega-scale social networks: [extended abstract]
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
Ken Wakita, Toshiyuki Tsurumi
ISVC
2009
Springer
16 years 10 hour ago
Energetic Path Finding across Massive Terrain Data
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
Andrew Tsui, Zoë J. Wood